Mobile pipelines parallelizing left looking algorithms using navigational programming

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.

Original document

The different versions of the original document can be found in:

• http://www.ics.uci.edu/~bic/messengers/papers/TR05-12.pdf

• http://link.springer.com/content/pdf/10.1007/11602569_24.pdf,

http://dx.doi.org/10.1007/11602569_24

• http://www.ics.uci.edu/~bic/messengers/papers/TR05-12.pdf,

https://link.springer.com/chapter/10.1007/11602569_24,

http://core.ac.uk/display/24576471,

https://dblp.uni-trier.de/db/conf/hipc/hipc2005.html#PanLDB05,

https://www.scipedia.com/public/Pan_et_al_2006a,

https://dl.acm.org/citation.cfm?id=2099331,

https://rd.springer.com/chapter/10.1007/11602569_24,

https://core.ac.uk/display/24576471,

https://academic.microsoft.com/#/detail/1500980468