Article

Free access

Predicated array data-flow analysis for run-time parallelization

Authors:

Sungdo Moon,

Mary W. Hall,

Brian R. MurphyAuthors Info & Claims

ICS '98: Proceedings of the 12th international conference on Supercomputing

Pages 204 - 211

https://doi.org/10.1145/277830.277874

Published: 13 July 1998 Publication History

PDF eReader

References

[1]

S. P. Amarasinghe. Parallelizing Compiler Techniques Based on Linear Inequalities. PhD thesis, Dept. of Electrical Engineering, Stanford University, January 1997.

Digital Library

Google Scholar

[2]

W. J. Blume. Symbolic Analysis Techniques {br Effective Automatic Parallelization. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, June 1995.

Digital Library

Google Scholar

[3]

P. Cousot and R. Cousot. Systematic design of program anaysis frameworks. In Conference Record o{ the Sixth Annual ACM Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, January 1979.

Digital Library

Google Scholar

[4]

G. Goff. Practical techniques to augment dependence analysis in the presence of symbolic terms. Technical Report TR92-194, Dept. of Computer Science, Rice University, October 1992.

Digital Library

Google Scholar

[5]

J. Gu, Z. Li, and G. Lee. Experience with efficient array data-flow analysis for array privatization. In Proceedings of the Sixth ACM SIG- PLAN Symposium on Principles & Practice of Parallel Programming, pages 157-167, Las Vegas, Nevada, June 1997.

Digital Library

Google Scholar

[6]

M.R. Haghighat. Symbolic Analysis.for Para!telizing Compilers. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana- Champaign, August 1994.

Digital Library

Google Scholar

[7]

M. W. Hall, B. R. Murphy, S. P. Amarasinghe, S.-W. Liao, and M. S. Lam. Interprocedural analysis for parallelization. In Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing, pages 61-80, Columbus, Ohio, August 1995.

Digital Library

Google Scholar

[8]

L.H. Holley and B. K. Rosen. Qualified data flow problems. In Con- .ference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, pages 68-82, Las Vegas, Nevada, January 1980.

Digital Library

Google Scholar

[9]

F. Irigoin. Interprocedural analyses for programming environments. In Proceedings of the NSF-CNRS Workxhop on Environment and Tools for Parallel Scientific Programming, September 1992.

Digital Library

Google Scholar

[10]

F. Nielson. Expected forms of data flow analysis, in H. Ganzinger and N. D. Jones, editors, Programs as Data Objects, volume 217 of Lecture Notes on Computer Science, pages 172-191. Springer-Verlag, October 1986.

Digital Library

Google Scholar

[11]

W. Pugh and D. Wonnacott. Eliminating false data dependences using the Omega test. In Proceedings of the ACM SIGPLAN '92 Conl%rence on Programming Language Design and Implementation, pages 140- 151, San Francisco, California, June 1992.

Digital Library

Google Scholar

[12]

L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In Proceedings of the ACM SIGPLAN '95 Conj'erence on Programming Language Design and Implementation, pages 218-232, La Jolla, California, June 1995.

Digital Library

Google Scholar

[13]

J. H. Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. IEEE Transaction on Computers, 40(5):603-612, May 1991.

Digital Library

Google Scholar

[14]

R. E. Strom and D. M. Yellin. Extending typestate checking using conditional liveness analysis. IEEE Transaction on Software Engineering, 19(5):478-485, May 1993.

Digital Library

Google Scholar

[15]

P. Tu. Automatic Array Privatization and Demand-driven Symbolic Analysis. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, May 1995.

Digital Library

Google Scholar

[16]

M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Transaction on Programming Languages and Systems, 13(2):180-210, April 1991.

Digital Library

Google Scholar

Cited By

View all

Chikin ALloyd TAmaral JTiotto EUsman M(2019)Memory-access-aware Safety and Profitability Analysis for Transformation of Accelerator-bound OpenMP LoopsACM Transactions on Architecture and Code Optimization10.1145/333306016:3(1-26)Online publication date: 18-Jul-2019
https://dl.acm.org/doi/10.1145/3333060
Strout MHall MOlschanowsky C(2018)The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor CodeProceedings of the IEEE10.1109/JPROC.2018.2857721106:11(1921-1934)Online publication date: Nov-2018
https://doi.org/10.1109/JPROC.2018.2857721
Brabrand CRibeiro MTolêdo TWinther JBorba P(2013)Intraprocedural dataflow analysis for software product linesTransactions on Aspect-Oriented Software Development X10.5555/2554488.2554491(73-108)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2554488.2554491
Show More Cited By

Recommendations

Evaluation of predicated array data-flow analysis for automatic parallelization

This paper presents an evaluation of a new analysis for parallelizing compilers called predicated array data-flow analysis. This analysis extends array data-flow analysis for parallelization and privatization to associate predicates with data-flow ...
Interprocedural array data-flow analysis
Efficient Interprocedural Array Data-Flow Analysis for Automatic Program Parallelization
Special issue on architecture-independent languages and software tools for parallel processing

Since sequential languages such as Fortran and C are more machine-independent than current parallel languages, it is highly desirable to develop powerful parallelization-tools which can generate parallel codes, automatically or semiautomatically, ...

Comments

Information & Contributors

Information

Published In

ICS '98: Proceedings of the 12th international conference on Supercomputing

July 1998

464 pages

ISBN:089791998X

DOI:10.1145/277830

Chairmen:
Greg Egan
Monash Univ.
,
Richard Brent
Oxford Univ.; and Australian National Univ., Canberra, Australia
,
Dennis Gannon
Indiana Univ.

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: 13 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS98

Sponsor:

SIGARCH
IEEE-CS

ICS98: 1998 International Conference on Supercomputing

Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
367
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)6

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chikin ALloyd TAmaral JTiotto EUsman M(2019)Memory-access-aware Safety and Profitability Analysis for Transformation of Accelerator-bound OpenMP LoopsACM Transactions on Architecture and Code Optimization10.1145/333306016:3(1-26)Online publication date: 18-Jul-2019
https://dl.acm.org/doi/10.1145/3333060
Strout MHall MOlschanowsky C(2018)The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor CodeProceedings of the IEEE10.1109/JPROC.2018.2857721106:11(1921-1934)Online publication date: Nov-2018
https://doi.org/10.1109/JPROC.2018.2857721
Brabrand CRibeiro MTolêdo TWinther JBorba P(2013)Intraprocedural dataflow analysis for software product linesTransactions on Aspect-Oriented Software Development X10.5555/2554488.2554491(73-108)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2554488.2554491
Sergey IDevriese DMight MMidtgaard JDarais DClarke DPiessens F(2013)Monadic abstract interpretersACM SIGPLAN Notices10.1145/2499370.249197948:6(399-410)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2499370.2491979
Bodden ETolêdo TRibeiro MBrabrand CBorba PMezini M(2013)SPLLIFTACM SIGPLAN Notices10.1145/2499370.249197648:6(355-364)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2499370.2491976
Cohen NPetrank E(2013)Limitations of partial compactionACM SIGPLAN Notices10.1145/2499370.249197348:6(309-320)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2499370.2491973
Sankaranarayanan SChakarov AGulwani S(2013)Static analysis for probabilistic programsACM SIGPLAN Notices10.1145/2499370.246217948:6(447-458)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2499370.2462179
Bodden ETolêdo TRibeiro MBrabrand CBorba PMezini MBoehm HFlanagan C(2013)SPLLIFTProceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2491956.2491976(355-364)Online publication date: 16-Jun-2013
https://dl.acm.org/doi/10.1145/2491956.2491976
Wang HTan SLi DGupta AYuan Y(2013)Composable thermal modeling and simulation for architecture-level thermal designs of multicore microprocessorsACM Transactions on Design Automation of Electronic Systems10.1145/2442087.244209918:2(1-27)Online publication date: 11-Apr-2013
https://dl.acm.org/doi/10.1145/2442087.2442099
Backasch RHochberger CWeiss ALeucker MLasslop R(2013)Runtime verification for multicore SoC with high-quality trace dataACM Transactions on Design Automation of Electronic Systems10.1145/2442087.244208918:2(1-26)Online publication date: 11-Apr-2013
https://dl.acm.org/doi/10.1145/2442087.2442089
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Evaluation of predicated array data-flow analysis for automatic parallelization

Interprocedural array data-flow analysis

Efficient Interprocedural Array Data-Flow Analysis for Automatic Program Parallelization