Automatic parallelization of canonical loops

This paper presents a compilation technique that performs the automatic parallelization of canonical loops. Canonical loops are a recurring pattern that we have observed in many well known algorithms, such as frequent itemset, K-means and K nearest neighbors. Our compiler translates C code to sequen...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Science of computer programming Ročník 78; číslo 8; s. 1193 - 1206
Hlavní autoři: da Mata, Leonardo Luiz Padovani, Pereira, Fernando Magno Quintão, Ferreira, Renato
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.08.2013
Témata:
Automatic parallelization
Compiler
Map-reduce
Stream-programming
Automatic parallelization
Compiler
Stream-programming
Map-reduce
ISSN:0167-6423, 1872-7964
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a compilation technique that performs the automatic parallelization of canonical loops. Canonical loops are a recurring pattern that we have observed in many well known algorithms, such as frequent itemset, K-means and K nearest neighbors. Our compiler translates C code to sequences of stream filters that communicate through a variety of channel types. We analyze code containing canonical loops, separate the data over a cluster of processors and determine suitable communication strategies between these processors. Experiments performed on a cluster of 36 computers show that, for the three algorithms described above, our method produces speed-ups that are almost linear on the number of available processors. These experiments also show that the code automatically generated is competitive when compared to hand tuned programs.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2012.09.006