Name
Abstract | ||
|---|---|---|
This paper presents an overview of our work, concerning a complete end-to-end framework for automatically generating message passing parallel code for tiled nested for-loops. It considers general parallelepiped tiling transformations and general convex iteration spaces. We address all problems regarding both the generation of sequential tiled code and its parallelization. We have implemented our techniques in a tool which automatically generates MPI parallel code and conducted several series of experiments, concerning the compilation time of our tool, the efficiency of the generated code and the speedup attained on a cluster of PCs. Apart from confirming the value of our techniques, our experimental results show the merit of general parallelepiped tiling transformations and verify previous theoretical work on scheduling-optimal tile shapes. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/967900.968184 | SAC |
Keywords | Field | DocType |
mpi,code generation,nested loops,message passing,automatic parallelization | Computer science,Parallel computing,Regular polygon,Code generation,Tile,Message passing,Parallelepiped,Speedup,Nested loop join,Automatic parallelization | Conference |
ISBN | Citations | PageRank |
1-58113-812-1 | 8 | 0.54 |
References | Authors | |
21 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georgios Goumas | 1 | 268 | 22.03 |
| Nikolaos Drosinos | 2 | 67 | 6.94 |
| Maria Athanasaki | 3 | 64 | 5.80 |
| N. Koziris | 4 | 1015 | 107.53 |