An efficient algorithm for irregular redistributions in parallelizing compilers

Authors:
Hui Wang;Minyi Guo;Sushil K. Prasad;Yi Pan;Wenxi Chen
Affiliations:
Department of Computer Software, University of Aizu, Aizu-Wakamatsu, Fukushima, Japan;Department of Computer Software, University of Aizu, Aizu-Wakamatsu, Fukushima, Japan;Department of Computer Science, Georgia State University, Atlanta, GA;Department of Computer Science, Georgia State University, Atlanta, GA;Department of Computer Software, University of Aizu, Aizu-Wakamatsu, Fukushima, Japan
Venue:
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Year:
2003

Citing 4
Cited 7

Efficient index set generation for compiling HPF array statements on distributed-memory machines

Journal of Parallel and Distributed Computing - Special issue on compilation techniques for distributed memory systems
Processor reordering algorithms toward efficient GEN_BLOCK redistribution

Proceedings of the 2001 ACM symposium on Applied computing
A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers

The Journal of Supercomputing
Contention-Free Communication Scheduling for Array Redistribution

ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems

Sparse Matrix Block-Cyclic Realignment on Distributed Memory Machines

The Journal of Supercomputing
Optimizing Communications of Dynamic Data Redistribution on Symmetrical Matrices in Parallelizing Compilers

IEEE Transactions on Parallel and Distributed Systems
Contention-Free communication scheduling for irregular data redistribution in parallelizing compilers

APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Scheduling convex bipartite communications toward efficient GEN_BLOCK transformations

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Efficient communication scheduling methods for irregular data redistribution in parallelizing compilers

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Irregular redistribution scheduling by partitioning messages

ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
On the complexity of the max-edge-coloring problem with its variants

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

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.