PATCH—a new algorithm for rapid incremental dependence analysis
Pages 424 - 432
References
[1]
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley Publishing Company, Reading, Massachusetts (1987).
[2]
Bill Appelbe, Kevin Smith, and Kurt Stirewalt, "PATCH - A New Algorithm for Rapid Incremental Dependence Analysis," Technical Report No. GIT- CC-91/24, Georgia institute of Technology (April, 1991).
[3]
Utpal Banerjee, Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Boston, Massachusetts (1988).
[4]
Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren, "The Program Dependence Graph and Its Use in Optimization," ACM Transactions on Programming Languages and Systems 9(3), pp. 319-349 (July 1987).
[5]
Barbara G. Ryder and Marvin C. Paull, "Incremental Data-Flow Analysis Algorithms," ACM Transactions on Programming Languages and Systems 10(1), pp. 1-50 (January 1988).
[6]
Kevin Smith, "PAT: an Interactive Fortran Parallelizing Assistant Tool," PhD Thesis, Georgia Institute of Technology, Atlanta, Georgia (December 1988).
[7]
Kevin Smith and Bill Appelbe, "Interactive Conversion of Sequential to Multitasking FORTRAN," Proceedings of the 3rd International Conference on Supercomputing, Crete, Greece, pp. 225-234 (June 5-9, 1989).
[8]
Kevin Smith, Bill Appelbe, and Kurt Stirewalt, "Incremental Dependence Analysis for Interactive Parallelization," Proceedings of the 1990 International Conference on Supercomputing, Amsterdam, The Netherlands, pp. 330-341 (June 11-15, 1990).
[9]
Michael J. Wolfe, Optimizing Supercompilers for Supercomputers, The MIT Press, Cambridge, Massachusetts (1989).
Index Terms
- PATCH—a new algorithm for rapid incremental dependence analysis
Recommendations
Incremental data dependence analysis
HIPC '96: Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)Under the existing framework for dependence analysis, every time a program is modified, exhaustive reanalysis has to be carried out to restructure the program. Often the changes in the program may be limited to a small portion. This may not affect a ...
Incremental resource usage analysis
PEPM '12: Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulationThe aim of incremental global analysis is, given a program, its analysis results and a series of changes to the program, to obtain the new analysis results as efficiently as possible and, ideally, without having to (re-)analyze fragments of code which ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1991 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]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1991
Check for updates
Qualifiers
- Article
Conference
ICS91
Sponsor:
ICS91: ACM SIGARCH International Conference on Supercomputing
June 17 - 21, 1991
Cologne, West Germany
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 229Total Downloads
- Downloads (Last 12 months)31
- Downloads (Last 6 weeks)16
Reflects downloads up to 30 Dec 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