Abstract | ||
---|---|---|
High Performance FORTRAN version 2 (HPF-2) provides irregular distributions such as GEN BLOCK and INDIRECT for load balancing and irregular problems. The irregular block redistribution problem is different from regular block-cyclic redistribution. This paper is devoted to develop an efficient algorithm that attempt to obtain near optimal scheduling while satisfying the minimal size of total steps condition and the minimal step condition for irregular array redistribution. Our algorithm is developed independently. It has comparable performance with a relocation algorithm developed previously. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/3-540-37619-4_10 | ISPA |
Keywords | Field | DocType |
irregular block redistribution problem,total steps condition,irregular distribution,regular block-cyclic redistribution,irregular redistribution,parallelizing compiler,minimal size,minimal step condition,irregular array redistribution,relocation algorithm,irregular problem,efficient algorithm,satisfiability,load balance | Computer science,Load balancing (computing),Scheduling (computing),Parallel computing,Algorithm,Fortran,Real-time computing,Compiler,Redistribution (cultural anthropology),Array redistribution,High Performance Fortran,Distributed computing | Conference |
Volume | ISSN | ISBN |
2745 | 0302-9743 | 3-540-40523-2 |
Citations | PageRank | References |
11 | 0.57 | 6 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hui Wang | 1 | 14 | 1.37 |
Minyi Guo | 2 | 3969 | 332.25 |
Prasad, Sushil K. | 3 | 355 | 46.44 |
Yi Pan | 4 | 2507 | 203.23 |
Wenxi Chen | 5 | 11 | 0.57 |