A Convex Programming Approach for Exploiting Data and Functional Parallelism on Distributed Memory Multicomputers
- 1 August 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 116-125
- https://doi.org/10.1109/icpp.1994.21
Abstract
Compilers have focused on the exploitation of one of functional or data parallelism in the past. The PARADIGM compiler project at the University of Illinois is among the first to incorporate techniques for simultaneous exploitation of both. The work in this paper describes the techniques used in the PARADIGM compiler and analyzes the optimality of these techniques. It is the first of its kind to use realistic cost models and includes data transfer costs which all previous researchers have neglected. Preliminary results on the CM-5 show the efficacy of our methods and the significant advantages of using functional and data parallelism together for execution of real applications.Keywords
This publication has 13 references indexed in Scilit:
- A parallel programming tool for scheduling on distributed memory multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A scheduling algorithm for parallelizable dependent tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Techniques to overlap computation and communication in irregular iterative applicationsPublished by Association for Computing Machinery (ACM) ,1994
- Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM CompilerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- A Heuristic of Scheduling Parallel Tasks and Its AnalysisSIAM Journal on Computing, 1992
- Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputersIEEE Transactions on Parallel and Distributed Systems, 1992
- A fast static scheduling algorithm for DAGs on an unbounded number of processorsPublished by Association for Computing Machinery (ACM) ,1991
- Geometric Programming: Methods, Computations and ApplicationsSIAM Review, 1980
- Performance Guarantees for Scheduling AlgorithmsOperations Research, 1978
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978