| タイトル | Automatic generation of efficient array redistribution routines for distributed memory multicomputers |
| 本文（外部サイト） | http://hdl.handle.net/2060/19940030437 |
| 著者（英） | Banerjee, Prithviraj; Ramaswamy, Shankar |
| 著者所属（英） | Illinois Univ. |
| 発行日 | 1994-04-08 |
| 言語 | eng |
| 内容記述 | Appropriate data distribution has been found to be critical for obtaining good performance on Distributed Memory Multicomputers like the CM-5, Intel Paragon and IBM SP-1. It has also been found that some programs need to change their distributions during execution for better performance (redistribution). This work focuses on automatically generating efficient routines for redistribution. We present a new mathematical representation for regular distributions called PITFALLS and then discuss algorithms for redistribution based on this representation. One of the significant contributions of this work is being able to handle arbitrary source and target processor sets while performing redistribution. Another important contribution is the ability to handle an arbitrary number of dimensions for the array involved in the redistribution in a scalable manner. Our implementation of these techniques is based on an MPI-like communication library. The results presented show the low overheads for our redistribution algorithm as compared to naive runtime methods. |
| NASA分類 | COMPUTER OPERATIONS AND HARDWARE |
| レポートNO | 94N34943
NASA-CR-195963
NAS 1.26:195963
UILU-ENG-94-2213
CRHC-94-09 |
| 権利 | No Copyright |
