Optimal processor mapping scheme for efficient communication of data realignment

Authors:
Ching-Hsien Hsu;Kun-Ming Yu;Chi-Hsiu Chen;Chang Wu Yu;Chiu Kuo Lian
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan , ROC;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan , ROC;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan , ROC;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan , ROC;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan , ROC
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 8
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
Compiling array expressions for efficient execution on distributed-memory machines

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

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

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

Parallel Computing
Multi-phase array redistribution: modeling and evaluation

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
A New Approach to Array Redistribution: Strip Mining Redistribution

PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe

Contention-Free communication scheduling for irregular data redistribution in parallelizing compilers

APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an OptimalProcessor Mapping (OPM) scheme to minimize data transmission cost for general BLOCK-CYCLIC data realignment. We examine a size oriented greedy matching method and the maximum bipartite matching theory to explore logical processor sequences. Based on these matching polices, the realigned sequences are used to perform data realignment in the destination phase. A significant improvement of our approach is that the OPM achieves high ratio of data remain in local space and leading minimum inter-processor communications. The OPM scheme could handle array realignment with arbitrary BLOCK-CYCLIC type and multidimensional arrays. Theoretical analysis and experimental results show that our technique provides considerable improvement for dynamic data realignment.