Brunel University Research Archive (BURA) >
School of Information Systems, Computing and Mathematics >
Mathematics Technical Papers >
Please use this identifier to cite or link to this item:
|Title: ||The scheduling of sparse matrix-vector multiplication on a massively parallel dap computer|
|Authors: ||Andersen, J|
|Publication Date: ||1991|
|Publisher: ||Brunel University|
|Citation: ||Maths Technical Papers (Brunel University). July1991 , pp 1-32|
|Abstract: ||An efficient data structure is presented which supports general unstructured sparse matrix-vector multiplications on a Distributed Array of Processors (DAP). This approach seeks to reduce the inter-processor data movements and organises the operations in batches of massively parallel steps by a heuristic scheduling procedure performed on the host computer.
The resulting data structure is of particular relevance to iterative schemes for solving linear systems. Performance results for matrices taken from well known Linear Programming (LP) test problems are presented and analysed.|
|Appears in Collections:||Mathematics Technical Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.