TY - GEN
T1 - From serial loops to parallel execution on distributed systems
AU - Bosilca, George
AU - Bouteiller, Aurelien
AU - Danalis, Anthony
AU - Herault, Thomas
AU - Dongarra, Jack
PY - 2012
Y1 - 2012
N2 - Programmability and performance portability are two major challenges in today's dynamic environment. Algorithm designers targeting efficient algorithms should focus on designing high-level algorithms exhibiting maximum parallelism, while relying on compilers and run-time systems to discover and exploit this parallelism, delivering sustainable performance on a variety of hardware. The compiler tool presented in this paper can analyze the data flow of serial codes with imperfectly nested, affine loop-nests and if statements, commonly found in scientific applications. This tool operates as the front-end compiler for the DAGuE run-time system by automatically converting serial codes into the symbolic representation of their data flow. We show how the compiler analyzes the data flow, and demonstrate that scientifically important, dense linear algebra operations can benefit from this analysis, and deliver high performance on large scale platforms.
AB - Programmability and performance portability are two major challenges in today's dynamic environment. Algorithm designers targeting efficient algorithms should focus on designing high-level algorithms exhibiting maximum parallelism, while relying on compilers and run-time systems to discover and exploit this parallelism, delivering sustainable performance on a variety of hardware. The compiler tool presented in this paper can analyze the data flow of serial codes with imperfectly nested, affine loop-nests and if statements, commonly found in scientific applications. This tool operates as the front-end compiler for the DAGuE run-time system by automatically converting serial codes into the symbolic representation of their data flow. We show how the compiler analyzes the data flow, and demonstrate that scientifically important, dense linear algebra operations can benefit from this analysis, and deliver high performance on large scale platforms.
KW - compiler analysis
KW - distributed computing
KW - symbolic data flow
KW - task scheduling
UR - http://www.scopus.com/inward/record.url?scp=84867650302&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-32820-6_25
DO - 10.1007/978-3-642-32820-6_25
M3 - Conference contribution
AN - SCOPUS:84867650302
SN - 9783642328190
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 246
EP - 257
BT - Parallel Processing - 18th International Conference, Euro-Par 2012, Proceedings
T2 - 18th International Conference on Parallel Processing, Euro-Par 2012
Y2 - 27 August 2012 through 31 August 2012
ER -