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.
- 1.A. Aho, J. Hopcroft, and 3. Ullmem. Dafa S~r'ac~ures and Algorithms. Addison- Wesley, 1983.Google Scholar
- 2.A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. Google ScholarDigital Library
- 3.F. Berman. Experience with an automatic solution to the mapping problem. In L. J amieson, D. Gannon, and B. Douglas, editors, The Characteristics of Parallel Algorithms, M.I.T. Press, 1987.Google Scholar
- 4.J.A.B. Fortes and D.I. Moldovan. Parallelism detection and transformation techniques useful for vlsi algorithms. Journal of.Parallel and Distributed Compuling, 2:277-301, 1985.Google ScholarCross Ref
- 5.M. 1~. Garey and D. S. Johnson. Computers and Intractability: A Guide ~o the Theory of NP.Completencu. W.H. Freeman and Company, New York, 1979. Google ScholarDigital Library
- 6.C. E. Houstis. Allocation of real-time applications to distributed systems. In Proceedinga of the ICPP, pages 863-866, 1987.Google Scholar
- 7.C.E. Houstis, E.N. Houstis, and J. It. Rice. Partitioning PDE Computations: Methods and Performance Evaluation. Technical Report CSD-TR 014, Purdue University, June 1986.Google Scholar
- 8.A. Kapauan, K. Wang, D. Cannon, J. Cuny, and L. Snyder. The pring}e: an experimental system for parallel algorithm and software testing. In Proceedings of the International Conference on Parallel Processors, 1984.Google Scholar
- 9.O. Kr~mer and H. Miihlenbein. Mapping strategies in message based multiprocessor systems. Springer Verlag Lecture No~es in Computer Science # P58, 213-225, 1987. Google ScholarDigital Library
- 10.P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theory and Applications. D. Reidel Publishing Company, Boston, 1987. Google ScholarDigital Library
- 11.V. Sarkar and J. Hennessy. Compile-time partitioning and scheduling of parallel programs. SIGPLAN No$ices, 21(7):17'-26, July I986. Google ScholarDigital Library
- 12.L. Snyder. Introduction to the configurable, highly parallel computer. Computer, 47-56, January 1982.Google Scholar
- 13.L. Snyder. Parallel programming and the poker programming environment. Computer, 27-36, July 1984.Google Scholar
- 14.J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, Maryland, 1984. Google ScholarDigital Library
- 15.S. White. Concepts of scale in simulated annealing. In Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers, 1984.Google ScholarCross Ref
Index Terms
Communication-sensitive heuristics and algorithms for mapping compilers
Recommendations
Communication-sensitive heuristics and algorithms for mapping compilers
Proceedings of the ACM/SIGPLAN PPEALS 1988The 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 ...
Portable Compilers for OpenMP
WOMPAT '01: Proceedings of the International Workshop on OpenMP Applications and Tools: OpenMP Shared Memory Parallel ProgrammingThe recent parallel language standard for shared memory multiprocessor (SMP) machines, OpenMP, promises a simple and portable interface for programmers who wish to exploit parallelism explicitly. In this paper, we present our effort to develop portable ...
Comments