skip to main content
poster

Exploiting global optimizations for openmp programs in the openuh compiler

Published: 14 February 2009 Publication History

Abstract

The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art optimizing compiler, but it only performs a limited set of optimizations for OpenMP programs due to its conservative assumptions of shared memory programming. These limitations may prevent some OpenMP applications from being fully optimized to the extent of its sequential counterpart. This paper describes our design and implementation of a parallel data flow framework, consisting of a Parallel Control Flow Graph (PCFG) and a Parallel SSA (PSSA) representation in OpenUH, to model data flow for OpenMP programs. This framework enables the OpenUH compiler to perform all classical scalar optimizations for OpenMP programs, in addition to conducting OpenMP specific optimizations.

References

[1]
Vasanth Balasundaram and Ken Kennedy. Compile-time detection of race conditions in a parallel program. In ICS '89: Proceedings of the 3rd international conference on Supercomputing, pages 175--185, Crete, Greece, June 1989. ACM Press.
[2]
D. Callahan, K. Kennedy, and J. Subhlok. Analysis of event synchronization in a parallel programming tool. In PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, pages 21--30, Seattle, Washington, United States, March 1990. ACM Press.
[3]
Jens Knoop, Bernhard Steffen, and Jurgen Vollmer. Parallelism for free: efficient and optimal bitvector analyses for parallel programs. ACM Trans. Program. Lang. Syst., 18(3):268--299, 1996.
[4]
Arvind Krishnamurthy and Katherine A. Yelick. Optimizing parallel programs with explicit synchronization. In SIGPLAN Conference on Programming Language Design and Implementation, pages 196--204, La Jolla, California, United States, June 1995.
[5]
J. Lee, D. A. Padua, and S. P. Midkiff. Basic compiler algorithms for parallel programs. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'99), pages 1--12, Atlanta, Georgia, United States, August 1999. ACM SIGPLAN.
[6]
Jurgen Vollmer. Data flow analysis of parallel programs. In PACT '95: Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques, pages 168--177, Manchester, United Kingdom, 1995. IFIP Working Group on Algol.

Cited By

View all
  • (2020)An open-source solution to performance portability for Summit and Sierra supercomputersIBM Journal of Research and Development10.1147/JRD.2019.295594464:3/4(12:1-12:23)Online publication date: 1-May-2020
  • (2014)TuningGenie: Auto-Tuning Framework Based on Rewriting RulesInformation and Communication Technologies in Education, Research, and Industrial Applications10.1007/978-3-319-13206-8_7(139-158)Online publication date: 28-Nov-2014
  • (2013)Parallelizing Legacy Fortran Programs Using Rewriting Rules Technique and Algebraic Program ModelsICT in Education, Research, and Industrial Applications10.1007/978-3-642-35737-4_3(39-59)Online publication date: 2013
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 44, Issue 4
PPoPP '09
April 2009
294 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1594835
Issue’s Table of Contents
  • cover image ACM Conferences
    PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
    February 2009
    322 pages
    ISBN:9781605583976
    DOI:10.1145/1504176
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: 14 February 2009
Published in SIGPLAN Volume 44, Issue 4

Check for updates

Author Tags

  1. compiler analysis
  2. openmp
  3. parallel ssa

Qualifiers

  • Poster

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2020)An open-source solution to performance portability for Summit and Sierra supercomputersIBM Journal of Research and Development10.1147/JRD.2019.295594464:3/4(12:1-12:23)Online publication date: 1-May-2020
  • (2014)TuningGenie: Auto-Tuning Framework Based on Rewriting RulesInformation and Communication Technologies in Education, Research, and Industrial Applications10.1007/978-3-319-13206-8_7(139-158)Online publication date: 28-Nov-2014
  • (2013)Parallelizing Legacy Fortran Programs Using Rewriting Rules Technique and Algebraic Program ModelsICT in Education, Research, and Industrial Applications10.1007/978-3-642-35737-4_3(39-59)Online publication date: 2013
  • (2014)Automatic and Portable Mapping of Data Parallel Programs to OpenCL for GPU-Based Heterogeneous SystemsACM Transactions on Architecture and Code Optimization10.1145/267703611:4(1-26)Online publication date: 8-Dec-2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media