Proceedings Article10.1109/ICPP.1993.60
Compiling Efficient Programs for Tightly-Coupled Distributed Memory Computers
PeiZong Lee,Tzung-Bow Tsai +1 more
- 16 Aug 1993
- Vol. 2, pp 161-165
10
TL;DR: A systhetic method for compiling programs on distributed memory parallel computers is presented and it is shown that this method can be used for compiling large numbers of programs in parallel.
read more
Abstract: In this paper, we present a systhetic method for compiling programs on distributed memory parallel computers.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient algorithms for data distribution on distributed memory parallel computers
TL;DR: Prune the searching space and derive efficient dynamic programming algorithms for determining effective data distribution schema to execute a sequence of Do-loops with a general structure if the communication cost due to performing this sequence of DOs is larger than a threshold value.
30
Performance and modularity benefits of message-driven execution
Attila Gursoy,Laxmikant V. Kale +1 more
TL;DR: It is argued that modularity and efficiency, in the form of overlapping communication latencies and processor idle times, can be achieved much more easily inmessage-driven execution than in message-passing SPMD style.
27
Techniques for compiling programs on distributed memory multicomputers
PeiZong Lee
- 01 Dec 1995
TL;DR: This paper presents techniques for compiling programs on distributed memory parallel computers and derives a dynamic programming algorithm for data distribution, and shows how to improve the communication time by pipelining data and illustrate how to use data-dependence information for pipelined data.
18
Compiling Efficient Programs for Tightly-Coupled Distributed Memory Computers
PeiZong Lee,Tzung-Bow Tsai +1 more
- 16 Aug 1993
TL;DR: A systhetic method for compiling programs on distributed memory parallel computers is presented and it is shown that this method can be used for compiling large numbers of programs in parallel.
10
Fortran RED - A Retargetable Environment for Automatic Data Layout
Ulrich Kremer
- 07 Aug 1998
TL;DR: This paper focuses on the discussion of the performance prediction component of the tool and reports preliminary results for a single scientific kernel on two target systems, namely PGI's and IBM's HPF compilers with IBM's SP-2 as the target architecture.
5
References
Index domain alignment: minimizing cost of cross-referencing between distributed arrays
Jingke Li,M. Chen +1 more
- 08 Oct 1990
TL;DR: The issue of data movement between processors due to cross-references between multiple distributed arrays is addressed and a heuristic algorithm is devised and shown to be efficient and to provide excellent results.
176
An Automatic and Symbolic Parallelization System for Distributed Memory Parallel Computers
K. Ikudome,Geoffrey C. Fox,A. Kolawa,J.W. Flower +3 more
- 08 Apr 1990
TL;DR: ASAR (Automatic and Symbolic PARallelization) is described which consists of a source-to-source parallelizer and a set of interactive graphic tools and is designed for easy modification for other languages such as Fortran.
Compiling Efficient Programs for Tightly-Coupled Distributed Memory Computers
PeiZong Lee,Tzung-Bow Tsai +1 more
- 16 Aug 1993
TL;DR: A systhetic method for compiling programs on distributed memory parallel computers is presented and it is shown that this method can be used for compiling large numbers of programs in parallel.
10
Compile-time estimation of communication costs on multicomputers
Manish Gupta,Prithviraj Banerjee +1 more
- 01 Mar 1992
TL;DR: The authors describe a methodology for statically estimating the communication times as certain functions of the array sizes and the numbers of processors over which various arrays used are distributed.
Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers
Manish Gupta,Prithviraj Banerjee +1 more
TL;DR: Results of a study performed on Fortran programs taken from the Linpack and Eispack libraries and the Perfect Benchmarks to determine the applicability of the approach to real programs demonstrate the feasibility of automatic data partitioning for programs with regular computations that may be statically analyzed.