A Pattern Language for Parallelizing Irregular Algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)


In irregular algorithms, data set's dependences and distributions cannot be statically predicted. This class of algorithms tends to organize computations in terms of data locality instead of parallelizing control in multiple threads. Thus, opportunities for exploiting parallelism vary dynamically, according to how the algorithm changes data dependences. This paper presents the first part of a pattern language for creating parallel implementations of irregular parallel algorithms and applications. Four patterns are proposed: Amorphous Data-Parallelism, Data-Parallel Graph,Optimistic Iteration and In-Order Iteration.
Original languageUnknown
Title of host publicationworkshop on Parallel Programming Patterns (ParaPLoP 2010)
Publication statusPublished - 1 Jan 2010
Eventworkshop on Parallel Programming Patterns (ParaPLoP 2010) -
Duration: 1 Jan 2010 → …


Conferenceworkshop on Parallel Programming Patterns (ParaPLoP 2010)
Period1/01/10 → …

Cite this