skip to main content
10.1145/62115.62136acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
Article
Free Access

Communication-sensitive heuristics and algorithms for mapping compilers

Published:01 January 1988Publication History

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.

References

  1. 1.A. Aho, J. Hopcroft, and 3. Ullmem. Dafa S~r'ac~ures and Algorithms. Addison- Wesley, 1983.Google ScholarGoogle Scholar
  2. 2.A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle Scholar
  4. 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 ScholarGoogle ScholarCross RefCross Ref
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.C. E. Houstis. Allocation of real-time applications to distributed systems. In Proceedinga of the ICPP, pages 863-866, 1987.Google ScholarGoogle Scholar
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theory and Applications. D. Reidel Publishing Company, Boston, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.V. Sarkar and J. Hennessy. Compile-time partitioning and scheduling of parallel programs. SIGPLAN No$ices, 21(7):17'-26, July I986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.L. Snyder. Introduction to the configurable, highly parallel computer. Computer, 47-56, January 1982.Google ScholarGoogle Scholar
  13. 13.L. Snyder. Parallel programming and the poker programming environment. Computer, 27-36, July 1984.Google ScholarGoogle Scholar
  14. 14.J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, Maryland, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.S. White. Concepts of scale in simulated annealing. In Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers, 1984.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Communication-sensitive heuristics and algorithms for mapping compilers

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
            January 1988
            246 pages
            ISBN:0897912764
            DOI:10.1145/62115
            • cover image ACM SIGPLAN Notices
              ACM SIGPLAN Notices  Volume 23, Issue 9
              Proceedings of the ACM/SIGPLAN PPEALS 1988
              Sept. 1988
              246 pages
              ISSN:0362-1340
              EISSN:1558-1160
              DOI:10.1145/62116
              Issue’s Table of Contents

            Copyright © 1988 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 January 1988

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader