A Data Partitioning Algorithm for Distributed Memory Compilation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper proposes a compiler strategy for mapping FORTRAN programs onto distributed memory computers. Once the available parallelism has been identified, the minimisation of different costs will suggest different data and computation partitions. This is further complicated, as the effectiveness of the partition will depend on later compiler optimisations. For this reason, partitioning is at the crux point of compilation and this paper describes an automatic data partition algorithm which is based on the analysis of four distinct factors. By determining the relative merit of each form of analysis, a data partitioning decision is made which is part of an overall compilation strategy. The strategy is applied to a real non-trivial program on a 32 cell KSR-1 where the performance is comparable to that of hand-coded techniques.
Original languageEnglish
Title of host publicationPARLE'94 Parallel Architectures and Languages Europe
Subtitle of host publication6th International PARLE Conference Athens, Greece, July 4–8, 1994 Proceedings
PublisherSpringer Berlin Heidelberg
Pages61-72
Number of pages12
ISBN (Electronic)978-3-540-48477-6
ISBN (Print)978-3-540-58184-0
DOIs
Publication statusPublished - 1994

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume817
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'A Data Partitioning Algorithm for Distributed Memory Compilation'. Together they form a unique fingerprint.

Cite this