Automatic data distribution for nearest neighbor networks
Philippsen M (1992)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 1992
Publisher: IEEE
Pages Range: 178-185
Conference Proceedings Title: Proceedings of the Fourth Symposium on the Frontiers of Massively Parallel Computation (Frontiers '92)
Event location: Mc Lean, VA, USA
ISBN: 0-8186-2772-7
URI: http://www2.informatik.uni-erlangen.de/publication/download/front92.pdf
Abstract
An algorithm for mapping an arbitrary, multidimensional array onto an arbitrarily shaped multidimensional nearest-neighbor network of a distributed memory machine is presented. The individual dimensions of the array are labeled with high-level usage descriptors that either can be provided by the programmer or can be derived by sophisticated static compiler analysis. The presented algorithm achieves an appropriate exploitation of nearest-neighbor communication and allows for efficient address calculations. The author describes the integration of this technique into an optimizing compiler for Modula-2 and derives extensions that render efficient translation of nested parallelism possible and that provide support for thread scheduling
Authors with CRIS profile
How to cite
APA:
Philippsen, M. (1992). Automatic data distribution for nearest neighbor networks. In Proceedings of the Fourth Symposium on the Frontiers of Massively Parallel Computation (Frontiers '92) (pp. 178-185). Mc Lean, VA, USA, US: IEEE.
MLA:
Philippsen, Michael. "Automatic data distribution for nearest neighbor networks." Proceedings of the Fourth Symposium on the Frontiers of Massively Parallel Computation (Frontiers '92), Mc Lean, VA, USA IEEE, 1992. 178-185.
BibTeX: Download