A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers

摘要

Array redistribution if required often in programs on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution; otherwise the performance of the programs Will degrade considerably. The redistribution overheads consist of two parts: index computation and inter- Processor communication. In this paper, by using a notation for the local data description called an LDD, We propose a framework to optimize the array redistribution algorithm both in index computation and Inter-processor communication.