Communication-sensitive heuristics and algorithms for mapping compilers

Authors:
Bernd Stramm;Francine Berman
Affiliations:
University of California, San Diego;University of California, San Diego
Venue:
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Year:
1988

Citing 6
Cited 2

Compile-time partitioning and scheduling of parallel programs

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Mapping Strategies in Message Based Multiprocessor Systems

Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures PARLE
Computational Aspects of VLSI

Computational Aspects of VLSI

The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme

IEEE Transactions on Software Engineering
Automatic partitioning and virtual scheduling for efficient parallel execution

ACM-SE 30 Proceedings of the 30th annual Southeast regional conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mapping problem arises when parallel algorithms are implemented on parallel machines. When the number of processes exceeds the number of available processing elements, the mapping problem includes the contraction problem. In this paper, we identify communication-sensitive heuristics which promote good contractions for graph-based parallel algorithms on non-shared memory multiprocessors. We present algorithms which utilize these heuristics and discuss their performance on a group of diverse benchmarks.