Article

Free access

Improving data-flow analysis with path profiles

Authors:

James R. LarusAuthors Info & Claims

PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation

Pages 72 - 84

https://doi.org/10.1145/277650.277665

Published: 01 May 1998 Publication History

Abstract

Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs' execution time and cost is concentrated in a far smaller subset of hot paths.This paper describes a new approach to analyzing and optimizing programs, which improves the precision of data flow analysis along hot paths. Our technique identifies and duplicates hot paths, creating a hot path graph in which these paths are isolated. After flow analysis, the graph is reduced to eliminate unnecessary duplicates of unprofitable paths. In experiments on SPEC95 benchmarks, path qualification identified 2--112 times more non-local constants (weighted dynamically) than the Wegman-Zadek conditional constant algorithm, which translated into 1--7% more dynamic instructions with constant results.

References

[1]

Glenn Ammons, Thomas Ball, and James R. Laxus. Exploiting hardware performance counters with flow and context sensitive profiling. In Proceedings of the SIGPLAN '97 Conference on Programraing Language Design and Implementation, June 1997.

Digital Library

[2]

Alfred V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 5, pages 255-300. MIT Press, 1994.

Digital Library

[3]

Rastislav Bod/k and Sadun Anlk. Path-sensitive value-flow analysis. In Proceedings of the SIGPLAN '98 Symposium on Principles of Programming Languages (POPL), January 1998.

Digital Library

[4]

Rastislav Bodik, Rajiv Gupta, and Mary Lou Sofia. Interprocedural conditional branch elimination. In Proceedings of the SiGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), pages 146-158, June 1997.

Digital Library

[5]

Rastislav Bodlk, Rajiv Gupta, and Mary Lou Sofia. Refining data flow information using infeasible paths. In Fifth A CM SIGSOFT Symposium on Foundations of Software Engineering and Sixth European Software Engineering Conference, September 1997.

Digital Library

[6]

Rastislav Bod{k, Rajiv Gupta, and Mary Lou Sofia. Complete removal of redundant computations. In Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), June 1998. To appear.

Digital Library

[7]

T. Ball and J. R. Larus. Efficient path profiling. In Proceedings of MICRO 96, pages 46-57, December 1996.

Digital Library

[8]

Joseph A. Fisher. Trace scheduIing: A technique for global mlcrocode compaction. IEEE Transactions on Computers, C-30(7):478-490, July 1981.

Digital Library

[9]

David Gries. Describing an algorithm by hopcroft. Acts Informatica, 2:97-109, 1973.

Digital Library

[10]

Allen Goldberg, T. C. Wang, and David Zimmerman. Applications of feasible path analysis to program testing. In International Symposium on Software Testing and Analysis. ACM SIGSOFT, August 1994.

Digital Library

[11]

L. Howard Holley and Barry K. Rosen. Qualified data flow probIems. IEEE 7~ansactions on Software Engineering, SE-7(1):60-78, January 1981.

[12]

Frank Mueller and David B. Whalley. Avoiding conditional branches by code replication. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation (PLDI), pages 56-66, June 1995.

Digital Library

[13]

Wen met W. Hwu, Scott A. Mahlke, William Y. Chen, Pohua P. Chang, Nancy J. Warter, Roger A. Brlngmann, Roland G. Ouellette, Richard E. Hank, Tokuzo Kiyohara, Grant E. Hash, John G. Holm, and Daniel M. Lavery. The superblock: An effective technique for VLIW and superscalar compilation. The Journal of Supercomputing, 7(1-2):229- 248, May 1993.

Digital Library

[14]

G. RamaJingam. Data flow frequency analysis. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 267-277, May 1996.

Digital Library

[15]

Robert P. Wilson, Robert S. French, Christopher S. Wilson, Saman P. Amarasinghe, Jennifer M. Anderson, Steve W. K. Tjiang, Shih-Wei Liao, Chau- Wen Tseng, Mary W. Hall, Monica S. Lain, and John L. Hennessy. An overview of the SUIF compiler system. Published on the World Wide Web at http://sulf, stanford.edu/suif/suifl/suif-overview/sulf, html.

[16]

Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. A CM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.

Digital Library

Cited By

Babu MLemerre MBardin SMarion J(2025)Trace Partitioning as an Optimization ProblemStatic Analysis10.1007/978-3-031-74776-2_2(26-60)Online publication date: 21-Jan-2025
https://doi.org/10.1007/978-3-031-74776-2_2
Liu CBénard PHertzmann AHoshyari S(2023)ConTesse: Accurate Occluding Contours for Subdivision SurfacesACM Transactions on Graphics10.1145/354477842:1(1-16)Online publication date: 19-Jan-2023
https://dl.acm.org/doi/10.1145/3544778
Chen HRossi RMahadik KKim SEldardiry H(2023)Graph Deep Factors for Probabilistic Time-series ForecastingACM Transactions on Knowledge Discovery from Data10.1145/354351117:2(1-30)Online publication date: 20-Feb-2023
https://dl.acm.org/doi/10.1145/3543511
Show More Cited By

Index Terms

Improving data-flow analysis with path profiles
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
2. Theory of computation
  1. Randomness, geometry and discrete structures
  2. Semantics and reasoning
    1. Program constructs
      1. Control primitives

Recommendations

Improving data-flow analysis with path profiles

Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their ...
Improving data-flow analysis with path profiles
20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection

Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their ...
Improving Side-Effect Analysis with Lazy Access Path Resolving
SCAM '09: Proceedings of the 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation

For scalability, many side-effect analysis methods choose inclusion-based context-insensitive (IBCI) pointer analysis as their basis. However, such a pointer analysis is known to be imprecise, which often results in over-conservative side-effect sets. In ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation

May 1998

357 pages

ISBN:0897919874

DOI:10.1145/277650

Chairmen:
Jack W. Davidson
Univ. of Virginia
,
Keith D. Cooper
Rice Univ. Houston, TX
,
Editor:
A. Michael Berman
Rowan Univ. Glassboro, NJ

ACM SIGPLAN Notices Volume 33, Issue 5
May 1998
358 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/277652
Chairmen:
Jack W. Davidson
Univ. of Virginia
,
Keith D. Cooper
Rice Univ., Houston, TX
,
Editor:
A. Michael Berman
Rowan Univ., Glassboro, NJ
Issue’s Table of Contents

Copyright © 1998 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

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI98

Sponsor:

SIGPLAN

PLDI98: Conference on Programming Language

June 17 - 19, 1998

Quebec, Montreal, Canada

Acceptance Rates

PLDI '98 Paper Acceptance Rate 31 of 136 submissions, 23%;

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

141
Total Citations
View Citations
1,290
Total Downloads

Downloads (Last 12 months)189
Downloads (Last 6 weeks)38

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Babu MLemerre MBardin SMarion J(2025)Trace Partitioning as an Optimization ProblemStatic Analysis10.1007/978-3-031-74776-2_2(26-60)Online publication date: 21-Jan-2025
https://doi.org/10.1007/978-3-031-74776-2_2
Liu CBénard PHertzmann AHoshyari S(2023)ConTesse: Accurate Occluding Contours for Subdivision SurfacesACM Transactions on Graphics10.1145/354477842:1(1-16)Online publication date: 19-Jan-2023
https://dl.acm.org/doi/10.1145/3544778
Chen HRossi RMahadik KKim SEldardiry H(2023)Graph Deep Factors for Probabilistic Time-series ForecastingACM Transactions on Knowledge Discovery from Data10.1145/354351117:2(1-30)Online publication date: 20-Feb-2023
https://dl.acm.org/doi/10.1145/3543511
Cui MChen CXu HZhou Y(2023)SafeDrop: Detecting Memory Deallocation Bugs of Rust Programs via Static Data-flow AnalysisACM Transactions on Software Engineering and Methodology10.1145/354294832:4(1-21)Online publication date: 26-May-2023
https://dl.acm.org/doi/10.1145/3542948
Chernikova AOprea A(2022)FENCE: Feasible Evasion Attacks on Neural Networks in Constrained EnvironmentsACM Transactions on Privacy and Security10.1145/354474625:4(1-34)Online publication date: 21-Jul-2022
https://dl.acm.org/doi/10.1145/3544746
Ioannou LFahmy S(2022)Streaming Overlay Architecture for Lightweight LSTM Computation on FPGA SoCsACM Transactions on Reconfigurable Technology and Systems10.1145/354306916:1(1-26)Online publication date: 22-Dec-2022
https://dl.acm.org/doi/10.1145/3543069
Sánchez JJörgensen NTörngren MInam RBerezovskyi AFeng LFersman ERamli MTan K(2022)Edge Computing for Cyber-physical Systems: A Systematic Mapping Study Emphasizing TrustworthinessACM Transactions on Cyber-Physical Systems10.1145/35396626:3(1-28)Online publication date: 7-Sep-2022
https://dl.acm.org/doi/10.1145/3539662
Wu CZhang RGuo JFan YCheng X(2022)Are Neural Ranking Models Robust?ACM Transactions on Information Systems10.1145/353492841:2(1-36)Online publication date: 21-Dec-2022
https://dl.acm.org/doi/10.1145/3534928
KUBOTA TAOTA NKONO K(2020)Logging Inter-Thread Data Dependencies in Linux KernelIEICE Transactions on Information and Systems10.1587/transinf.2019EDP7255E103.D:7(1633-1646)Online publication date: 1-Jul-2020
https://doi.org/10.1587/transinf.2019EDP7255
Cyphert JBreck JKincaid ZReps T(2019)Refinement of path expressions for static analysisProceedings of the ACM on Programming Languages10.1145/32903583:POPL(1-29)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290358
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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 Table of Contents