Incremental dependence analysis for interactive parallelization
Pages 330 - 341
Abstract
Incrementally updating dependence information during interactive parallelization is a difficult proposition. We have developed a tool (PAT) that maintains dependence information during incremental transformations to a Fortran program, including loop parallelization, code replication, alignment and shifting, as well as insertion and deletion of code including parallel primitives. Our analysis is based on a variation on the standard approach to dependence graph generation, with program wide and local information separated in a sequential and a parallel dependence graph.
References
[1]
IBM Parallel FORTRAN, Language and Library Reference, International Business Machines Corporation (1988).
[2]
Alfred V. Aho, Ravi Sethi, and Jeffrey D. UUman, Compilers: Principles, Techniques and Tools, Addison-Wesley Publishing Company, Reading, Massachusetts (1987).
[3]
J.R. Alien, Ken Kennedy, Carrie Porterfield, and Joe Warren, "Conversion of Control Dependence to Data Dependence," Conference Record of the Tenth Annual ACM Symposium on Principles of Programruing Languages, Austin, Texas (January 1983).
[4]
Randy Allen, "Dependence Analysis for Subscripted Variables and its Application to Program Transformations," Phi) Dissertation, Department of Mathematical Science, Rice University, Houston, Texas (April 1983).
[5]
Randy Allen, Donn Baumgartner, Ken Kennedy, and Allan Porterfield, "PTOOL: A Semi-automatic Parallel Programming Assistant," Computer Science Technical Report, Rice University (January 1987).
[6]
Randy Allen, David Callahan, and Ken Kennedy, "Automatic Decomposition of Scientific Programs for Parallel Execution," Computer Science Technical Report, Rice COMP TR86-42, Rice University (November, 1986).
[7]
Randy Allen and Ken Kennedy, "Automatic Translation of Fortran Programs to Vector Form," Computer Science Technical Report, Rice COMP TR84- 9, Rice University (July, 1984).
[8]
Bill Appelbe and Kevin Smith, Analyzing Loops for Parallelism, submitted to the Journal of Parallel and Distributed Computing.
[9]
Bill Appelbe and Kevin Smith, "Replication and Alignment: A Unified Theory," Technical Report NO. G IT-ICS 88/36, Georgia Institute of Technology (October 1988).
[10]
Vasanth Balasundaram, "Interactive Parallelization of Numerical Scientific Programs," PhD Thesis, Department of Computer Science, Rice University (May 1989).
[11]
Utpal Banerjee, Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Boston, Massachusetts (1988).
[12]
David Callahan, "A Global Approach to Detection of Parallelism," PhD Thesis, Rice COMP TR87-50, Rice University (April 1987).
[13]
David Callahan, lack Dongarra, and David Levine, "Vectorizing Compilers: A Test Suite and Results," Proceedings of Supercomputing '88, Orlando, Florida, pp. 98-105 (November 14-18, 1988).
[14]
Leslie A. Henderson, "The Usefulness of Dependency-Analysis Tools in Parallel Programming: Experiences Using Ptool," Technical Report LA-UR-87-3135, Los Alamos National Laboratory, Los Alamos, New Mexico (1988).
[15]
Gyungho Lee, Clyde P. Kruskal, and David I. Kuck, "The Effectiveness of Automatic Restructuring on Nonnumerical Programs," Proceedings of the 1985 International Conference on Parallel Processing, Los Angeles, California, pp. 607-613, IEEE Computer Society (August 20-23, 1985).
[16]
Zhiyuan Li, Pen-Chung Yew, and Chuan-Qi Zhu, "Data Dependence Analysis on Mul~dimensional Axray References," Proceedings of the 3rd International Conference on Supercomputing, Crete, Greece, pp. 215-224 (June 5-9, 1989).
[17]
Constantine D. Polychronopoulos, Parallel Programming and Compilers, Kluwer Academic Publishers, Boston, Massachusetts (1988).
[18]
Kevin Smith, "PAT: an Interactive Fortran Paxallelizing Assistant Tool," PhD Thesis, Georgia Institute of Technology, Atlanta, Georgia (December 1988).
[19]
Kevin Smith and Bill Appelbe, "Interactive Conversion of Sequential to Multitasking FORTRAN," Proceedings of the 3rd Internan'onal Conference on Supercomputing, Crete, Greece, pp. 225-234 (June 5-9, 1989),
[20]
Kevin Smith and William F. Appelbe, "PAT--An Interactive Fortran Parallelizing Assistant Tool," Proceedings of the 1988 International Conference on Parallel Processing, St. Charles, Illinois, pp. 58- 62, Penn State Press (August 15-19, 1988).
[21]
R.A. Towle, "Control and Data Dependence for Program Transformation," PhD Dissertation, Report 76-788, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois (March 1976).
[22]
Michael Wolfe, "Advanced Loop Interchanging," Proceedings of the 1986 International Conference on Parallel Processing, Los Angeles, California, pp. 536-543, IEEE Computer Society (August 19- 22, 1986).
[23]
Michael J. Wolfe, "Optimizing Supercompilers for Supercomputers," PhD Thesis, UIUCDCS-R-82- 1105, University of Illinois at Urbana-Champaign (October 1982).
Index Terms
- Incremental dependence analysis for interactive parallelization
Recommendations
Incremental dependence analysis for interactive parallelization
ICS '90: Proceedings of the 4th international conference on SupercomputingIncrementally updating dependence information during interactive parallelization is a difficult proposition. We have developed a tool (PAT) that maintains dependence information during incremental transformations to a Fortran program, including loop ...
Automatic speculative parallelization of loops using polyhedral dependence analysis
COSMIC '13: Proceedings of the First International Workshop on Code OptimiSation for MultI and many CoresSpeculative Execution (SE) runs loops in parallel even in the presence of a dependence. Using polyhedral dependence analysis, more speculation candidate loops can be discovered than normal OpenMP parallelization. In this research, a framework is ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sept. 1990
489 pages
Copyright © 1990 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: 01 June 1990
Published in SIGARCH Volume 18, Issue 3b
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations10Total Citations
- 388Total Downloads
- Downloads (Last 12 months)65
- Downloads (Last 6 weeks)20
Reflects downloads up to 18 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in