article

Free access

Interprocedural dependence analysis and parallelization

Authors:

Ron CytronAuthors Info & Claims

ACM SIGPLAN Notices, Volume 21, Issue 7

Pages 162 - 175

https://doi.org/10.1145/13310.13328

Published: 01 July 1986 Publication History

Abstract

We present a method that combines a deep analysis of program dependences with a broad analysis of the interaction among procedures. The method is more efficient than existing methods: we reduce many tests, performed separately by existing methods, to a single test. The method is more precise than existing methods with respect to references to multi-dimensional arrays and dependence information hidden by procedure calls. The method is more general than existing methods: we accommodate potentially aliased variables and structures of differing shapes that share storage. We accomplish the above through a unified approach that integrates subscript analysis with aliasing and interprocedural information.

References

[1]

John R. Allen, "Dependence Analysis for Subscript Variables and Its Application to Program Transformations", Rice Ph.D. Thesis, April 1983.

Digital Library

[2]

Utpal Banerjee, "Data Dependence in Ordinary Programs", M,S. Thesis, University of Illinois at Urbana-Champaign, DCS Report No. UIUCDCS-R-76-837, November 1976.

[3]

Utpal Banerjee, "Speedup of Ordinary Programs", Ph.D. Thesis, University of Illinois at Urbana- Champaign, DCS Report No. UIUCDCS-R-79-989, October 1979.

Digital Library

[4]

John Banning, "An Efficient Way to Find the Side Effects of Procedure Calls and the Aliases of Variables", Conf. Rec. Seventh ACM Symposium on Principles of Programming Languages, January 1980.

Digital Library

[5]

Michael Burke, "An Interval Analysis Approach Toward Interprocedural Data Flow", IBM Research Report RC 10640, July 1984.

[6]

Michael Burke and Ron Cytron, "Interprocedural Dependence Analysis and Parallelization", IBM Research Report RCI 1794, April, 1986.

[7]

Keith Cooper, "Interprocedural Data Flow Analysis in a Programming Environment", Rice Ph.D. Thesis, April 1983.

Digital Library

[8]

Keith Cooper, "Analyzing Aliases of Reference Formal Parameters", Conf. Rec. Twelfth ACM Symposium on Principles of Programming Languages, 281-290, January 1985.

Digital Library

[9]

Keith Cooper and Ken Kennedy, "Efficient Computation of Flow Insensitive Interproeedurai Summary Information", Proceedings of the SIGPLAN 84 Symposiumon Compiler Construction, June 1984.

Digital Library

[10]

Ron Cytron, "Compile-time Scheduling and Optimization for Asynchronous Machines", Ph.D. Thesis, University of Illinois at Urbana- Champaign, August, 1982.

[11]

Christopher A. Huson, "An In-Line Subroutine Expander for Parafrase", M.S. Thesis, University of Illinois at Urbana-Champaign, 1982.

[12]

G. KildaU, "A Unified Approach to Program Optimization", Conf, Rec. First A CM Symposium on Principles of Programming Languages, 194-206, October 1973.

Digital Library

[13]

David J. Kuck, The Structure of Computers and Computations, Volume 1, John Wiley and Sons, New York, 1978.

Digital Library

[14]

Bruce R. Leasure, "Compiling Serial Languages for Parallel Machines", M.S. Thesis, University of Illinois at Urbana-Champaign, 1976.

[15]

J.H. Reif and H.R. Lewis, "Symbolic Evaluation and the Global Value Graph", Conf. Rec. Fourth ACM Symposium on Principles of Programming Languages, January 1977.

Digital Library

[16]

Robert Shostak, "Deciding Linear Inequalities by Computing Loop Residues", Journal of the Association for Computing Machinery, Vol. 28, No. 4, October 1981.

Digital Library

[17]

Remi J. Triolet, "Contribution a la Parellisation Automatique de Programmes Fortran Comportant des Appels de Procedure", Ph.D. Thesis, L'Universite Pierre et Marie Curie (Paris VI), December 1984.

[18]

Mark Wegman and Ken Zadeck, "Constant Propagation with Conditional Branches", Conf. Rec. Twelfth ACM Symposium on Principles of Programming Languages, 291-299, January 1985.

Digital Library

[19]

Michael J. Wolfe, "Optimizing Supercompilers for Supercomputers", Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1982.

Digital Library

Cited By

van den Bos PJongmans S(2023)VeyMont: Parallelising Verified Programs Instead of Verifying Parallel ProgramsFormal Methods10.1007/978-3-031-27481-7_19(321-339)Online publication date: 3-Mar-2023
https://doi.org/10.1007/978-3-031-27481-7_19
Khan SChatterjee BPande SRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)VICOProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532393(1-14)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532393
Honorio Bde Carvalho JSkaf MAraujo G(2020)Using OpenMP to Detect and Speculate Dynamic DOALL LoopsOpenMP: Portable Multi-Level Parallelism on Modern Systems10.1007/978-3-030-58144-2_15(231-246)Online publication date: 22-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58144-2_15
Show More Cited By

Index Terms

Recommendations

Interprocedural dependence analysis and parallelization
20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection

The area of dependence analysis has served as grounds for fruitful research as well as practical implementation. Compilers and tools that utilize dependence information can generate code that takes advantage of parallel resources and storage hierarchies ...
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Interprocedural dependence analysis and parallelization
SIGPLAN '86: Proceedings of the 1986 SIGPLAN symposium on Compiler construction

We present a method that combines a deep analysis of program dependences with a broad analysis of the interaction among procedures. The method is more efficient than existing methods: we reduce many tests, performed separately by existing methods, to a ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 21, Issue 7

July 1986

275 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/13310

Editor:
Richard L. Wexelblat
Philips Laboratories, Briarcliff Manor, NY

Issue’s Table of Contents

SIGPLAN '86: Proceedings of the 1986 SIGPLAN symposium on Compiler construction
July 1986
275 pages
ISBN:0897911970
DOI:10.1145/12276
Editor:
Richard L Wexelblat
Philips Laboratories, Briarcliff Manor, NY

Copyright © 1986 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1986

Published in SIGPLAN Volume 21, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

239
Total Citations
View Citations
1,012
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)11

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

van den Bos PJongmans S(2023)VeyMont: Parallelising Verified Programs Instead of Verifying Parallel ProgramsFormal Methods10.1007/978-3-031-27481-7_19(321-339)Online publication date: 3-Mar-2023
https://doi.org/10.1007/978-3-031-27481-7_19
Khan SChatterjee BPande SRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)VICOProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532393(1-14)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532393
Honorio Bde Carvalho JSkaf MAraujo G(2020)Using OpenMP to Detect and Speculate Dynamic DOALL LoopsOpenMP: Portable Multi-Level Parallelism on Modern Systems10.1007/978-3-030-58144-2_15(231-246)Online publication date: 22-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58144-2_15
Singal GGopalani DKushwaha RBadal T(2019)Automatic Parallelization of C Code Using OpenMPEmerging Technologies in Computer Engineering: Microservices in Big Data Analytics10.1007/978-981-13-8300-7_25(298-309)Online publication date: 18-May-2019
https://doi.org/10.1007/978-981-13-8300-7_25
Ma SBertino ENepal SLi JOstry DDeng RJha S(2019)Finding Flaws from Password Authentication Code in Android AppsComputer Security – ESORICS 201910.1007/978-3-030-29959-0_30(619-637)Online publication date: 15-Sep-2019
https://doi.org/10.1007/978-3-030-29959-0_30
Creusillet BIrigoin F(2016)Interprocedural Array Region AnalysesInternational Journal of Parallel Programming10.1007/BF0335675824:6(513-546)Online publication date: 26-May-2016
https://doi.org/10.1007/BF03356758
Best MMottishaw SMustard CRoth MFedorova ABrownsword A(2010)Synchronization via schedulingProceedings of the 2nd USENIX conference on Hot topics in parallelism10.5555/1863086.1863093(7-7)Online publication date: 14-Jun-2010
https://dl.acm.org/doi/10.5555/1863086.1863093
Vandierendonck HRul SDe Bosschere KSalapura VGschwind MKnoop J(2010)The Paralax infrastructureProceedings of the 19th international conference on Parallel architectures and compilation techniques10.1145/1854273.1854322(389-400)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.1145/1854273.1854322
Tian CFeng MGupta R(2010)Speculative parallelization using state separation and multiple value predictionACM SIGPLAN Notices10.1145/1837855.180666345:8(63-72)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1837855.1806663
Mannarswamy SChakrabarti DRajan KSaraswati S(2010)Compiler aided selective lock assignment for improving the performance of software transactional memoryACM SIGPLAN Notices10.1145/1837853.169346045:5(37-46)Online publication date: 9-Jan-2010
https://dl.acm.org/doi/10.1145/1837853.1693460
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents