Name
Abstract | ||
|---|---|---|
This paper presents a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. It considers general parallelepiped tiling transfor- mations and general convex iteration spaces. We aim to address all problems concerning data parallel code gener- ation efficiently by transforming the initial non-rectangular tile to a rectangular one. In this way, data distribution and communication become simple and straightforward. We have implemented our parallelizing techniques in a tool which automatically generates MPI code and run several experiments on a cluster of PCs. Our experimental results show the merit of general parallelepiped tiling transforma- tions, and confirm previous theoretical work on scheduling- optimal tile shapes. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/CLUSTR.2002.1137768 | CLUSTER |
Keywords | DocType | ISBN |
high performance computing,shape,indexing terms,scheduling,parallel programming,clusters,message passing,mpi,code generation,loop tiling | Conference | 0-7695-1745-5 |
Citations | PageRank | References |
12 | 0.71 | 12 |
Authors | ||
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 |