Skip to main content
SpringerLink
Log in

Achieving multi-level parallelization

  • IV Compilers
  • Conference paper
  • First Online:
High Performance Computing (ISHPC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1336))

Included in the following conference series:

Abstract

Many modern machine architectures feature parallel processing at both the fine-grain and coarse-grain level. In order to efficiently utilize these multiple levels; a parallelizing compiler must orchestrate the interactions of fine-grain and coarse-grain transformations. The goal of the PROMIS compiler project is to develop a multi-source, multitarget parallelizing compiler in which the front-end and back-end are integrated via a single unified intermediate representation. In this paper, we examine the appropriateness of the Hierarchical Task Graph as that representation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Milind B. Girkar and Constantine Polychronopoulos. Automatic extraction of functional parallelism from ordinary programs. IEEE Transactions on Parallel and Distributed Systems. 3(2), March 1992.

    Google Scholar 

  2. Milind Baburao Girkar. Functional Parallelism: Theoretical Foundations and Implementations. PhD dissertation. University of Illinois at Urbana-Champaign. December 1991. Available as CSRD Report 1182.

    Google Scholar 

  3. R. Gupta and M.L. Soffa. Region scheduling: An approach for detecting and redistributing parallelism. TOSE, 16(4), April 1990.

    Google Scholar 

  4. Mohammad R. Haghighat and Constantine Polychronopoulos. Symbolic analysis for parallelizing compilers. ACM Transactions on Programming Languages and Systems. 18(4).

    Google Scholar 

  5. Alexandru Nicolau and Steve Novack. Trailblazing: A hierarchical approach to percolation scheduling. In Proceedings of the International Conference on Parallel Processing, St. Charles, IL, pages II120–124. The Pennsylvania State University Press. August 1993.

    Google Scholar 

  6. S. H. Novack. The EVE Mutation Scheduling Compiler: Adaptive Code Generation for Advanced Microprocessors. PhD thesis; University of California. Irvine. 1997.

    Google Scholar 

  7. Steve Novack. Joseph Hummel, and Alexandru Nicolau. A simple mechanism for improving the accuracy and efficiency of instruction-level disambiguation. In Proceedings of the 8th Annual Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science No. 1033. pages 289–303. SpringerVerlag. August 1995.

    Google Scholar 

  8. Steve Novack and Alexandru Nicolau. VISTA: The visual interface for scheduling transformations and analysis. In Proceedings of the 6th Annual Workshop on Languages and Compilers for Parallel Computing; Lecture Notes in Computer Science No. 768, pages 449–460. Springer-Verlag. August 1993.

    Google Scholar 

  9. Steve Novack and Alexandru Nicolau. Mutation scheduling: A unified approach to compiling for fine-grain parallelism. In Proceedings of the 7th Annual Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science No. 892, pages 16–30. Springer-Verlag. August 1994.

    Google Scholar 

  10. Steve Novack and Alexandru Nicolau. Resource-directed loop pipelining. In Proceedings of the 9th Annual Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science. Springer-Verlag. August 1996. To appear.

    Google Scholar 

  11. Constantine Polychronopoulos. Milind B. Girkar. Mohammad R. Haghighat. Chia L. Lee. Bruce P. Leung, and Dale A. Schouten. Parafrase-2: An environment for parallelizing, partitioning, synchronizing, and scheduling programs on multi processors. In Proceedings of the International Conference on Parallel Processing, St. Charles IL, pages II39 48. August 1989. also in International Journal of High Speed Computing. Vol. 1. No. 1. 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Science, University of California, 92697-3425, Irvine, CA

    Carrie J. Brownhill & Alexandru Nicolau

  2. Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1308 W. Main St., 61801, Urbana, IL

    Steve Novack & Constantine D. Polychronopoulos

Authors
  1. Carrie J. Brownhill
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandru Nicolau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steve Novack
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Constantine D. Polychronopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Constantine Polychronopoulos Kazuki Joe Keijiro Araki Makoto Amamiya

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brownhill, C.J., Nicolau, A., Novack, S., Polychronopoulos, C.D. (1997). Achieving multi-level parallelization. In: Polychronopoulos, C., Joe, K., Araki, K., Amamiya, M. (eds) High Performance Computing. ISHPC 1997. Lecture Notes in Computer Science, vol 1336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024215

Download citation

  • DOI: https://doi.org/10.1007/BFb0024215

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63766-0

  • Online ISBN: 978-3-540-69644-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation