(Created page with " == Abstract == We consider the class of left-looking sequential matrix algorithms: consumer-driven algorithms that are characterized by lazy propagation of data. Lef...") |
m (Scipediacontent moved page Draft Content 563030481 to Pan et al 2006a) |
(No difference)
| |
Revision as of 15:16, 14 October 2020
Abstract
We consider the class of left-looking sequential matrix algorithms: consumer-driven algorithms that are characterized by lazy propagation of data. Left-looking algorithms are difficult to parallelize using the message-passing or distributed shared memory models because they only possess pipeline parallelism. We show that these algorithms can be directly parallelized using mobile pipelines provided by the Navigational Programming methodology. We present performance data demonstrating the effectiveness of our approach.
Document type: Part of book or chapter of book
Full document
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2006
Volume 2006, 2006
DOI: 10.1007/11602569_24
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?