Name
Abstract | ||
|---|---|---|
In this paper we revisit the supernode-shape selection problem, that has been widely discussed in bibliography. In general, the selection of the supernode transformation greatly affects the parallel execution time of the transformed algorithm. Since the minimization of the overall parallel execution time via an appropriate supernode transformation is very difficult to accomplish, researchers have focused on scheduling-aware supernode transformations that maximize parallelism during the execution. In this paper we argue that the communication volume of the transformed algorithm is an important criterion, and its minimization should be given high priority. For this reason we define the metric of the per process communication volume and propose a method to minimize this metric by selecting a communication-aware supernode shape. Our approach is equivalent to defining a proper Cartesian process grid with MPI_Cart_Create, which means that it can be incorporated in applications in a straightforward manner. Our experimental results illustrate that by selecting the tile shape with the proposed method, the total parallel execution time is significantly reduced due to the minimization of the communication volume, despite the fact that a few more parallel execution steps are required. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TPDS.2008.114 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
tile shape,overall parallel execution time,load balancing and task assignment,process grid,communication-aware supernode shape,scheduling,grid computing,scheduling-aware supernode transformation,communication-aware supernode shape selection problem,parallel execution step,supernode transformation,parallel processors,scheduling-aware supernode transformations,mpi_cart_create,communication volume,cartesian process grid,data communications,parallel architectures,scheduling.,index terms— loop tiling,message passing,mpi,i/o and data communications,appropriate supernode transformation,process communication volume,parallel execution time,scheduling and task partitioning,total parallel execution time,loop tiling,parallel processing,computational modeling,computer architecture,indexing terms,shape,image processing | Grid computing,Computer science,Scheduling (computing),Parallel computing,Image processing,Real-time computing,Minification,Supernode,Message passing,Grid,Distributed computing,Cartesian coordinate system | Journal |
Volume | Issue | ISSN |
20 | 4 | 1045-9219 |
Citations | PageRank | References |
4 | 0.42 | 30 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georgios Goumas | 1 | 268 | 22.03 |
| Nikolaos Drosinos | 2 | 67 | 6.94 |
| N. Koziris | 3 | 1015 | 107.53 |