Efficient communication scheduling methods for irregular data redistribution in parallelizing compilers

Authors:
Shih-Chang Chen;Ching-Hsien Hsu;Chao-Yang Lan;Chao-Tung Yang;Kuan-Ching Li
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan;Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan;Department of Computer Science and Information Management, Providence University, Taichung, Taiwan
Venue:
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Year:
2005

Citing 16
Cited 1

Optimization of array redistribution for distributed memory multicomputers

Parallel Computing
Processor Mapping Techniques Toward Efficient Data Redistribution

IEEE Transactions on Parallel and Distributed Systems
Optimizations for efficient array redistribution on distributed memory multicomputers

Journal of Parallel and Distributed Computing - Special issue on compilation techniques for distributed memory systems
Fast runtime block cyclic data redistribution on multiprocessors

Journal of Parallel and Distributed Computing
Scheduling Block-Cyclic Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Algorithmic Redistribution Methods for Block-Cyclic Decompositions

IEEE Transactions on Parallel and Distributed Systems
Efficient Algorithms for Block-Cyclic Array Redistribution Between Processor Sets

IEEE Transactions on Parallel and Distributed Systems
A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Contention-free communication scheduling for array redistribution

Parallel Computing
Processor reordering algorithms toward efficient GEN_BLOCK redistribution

Proceedings of the 2001 ACM symposium on Applied computing
A Generalized Processor Mapping Technique for Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Sparse Matrix Block-Cyclic Redistribution

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Multi-phase array redistribution: modeling and evaluation

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Symbolic Communication Set Generation for Irregular Parallel Applications

The Journal of Supercomputing
A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers

The Journal of Supercomputing
An efficient algorithm for irregular redistributions in parallelizing compilers

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications

Optimizing scheduling stability for runtime data alignment

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Irregular array redistribution has been paid attention recently since it can distribute different size of data segment to processors according to their own computation ability. It's also the reason why it has been kept an eye on load balance. In this work, we present a two-phase degree-reduction (TPDR) method for scheduling HPF2 irregular data redistribution. An extended algorithm based on TPDR is also presented. Effectiveness of the proposed methods not only avoids node contention but also shortens the overall communication length. To evaluate the performance of our methods, we have implemented both algorithms along with the divide-and-conquer algorithm. The simulation results show improvement of communication costs.