Dependence graphs and compiler optimizations

Kuck, David J.; Kuhn, Robert H.; Padua, David; Leasure, Bruce; Wolfe, Michael

doi:10.1145/567532.567555

Cited by 514 publications

(166 citation statements)

References 13 publications

Supporting

Mentioning

161

Contrasting

Unclassified

Order By: Relevance

“…Node splitting has been applied in [31] to break cycles of dependences in the data dependence graph and, hence, generate better code for parallel machines. We believe node splitting also has an important role in process partitioning for multiprocessors in that it can be used to reduce communication and synchronization costs: nodes can be duplicated in several processes to lower communication and synchronization costs between them.…”

Section: Node Splittingmentioning

confidence: 99%

“…The Data Flow Graph [36,37] represents global data dependence at the operator level (called the atomic level in [31]). Transformations that involve both control and data dependence cannot be specified in a consistent manner with this form, however, since control is represented by a conventional control flow graph.…”

Section: Introduction This Paper Introduces a Program Representationmentioning

confidence: 99%

See 1 more Smart Citation

The program dependence graph and its use in optimization

Ferrante

Ottenstein

Warren

1984

Lecture Notes in Computer Science

520

806

View full text Add to dashboard Cite

In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. Control dependence5 are introduced to analogously represent only the essential control flow relationships of a program. Control dependences are derived from the usual control flow graph. Many traditional optimizations operate more efficiently on the PDG. Since dependences in the PDG connect computationally related parts of the program, a single walk of these dependences is sufficient to perform many optimizations. The PDG allows transformations such as vectorization, that previously required special treatment of control dependence, to be performed in a manner that is uniform for both control and data dependences. Program transformations that require interaction of the two dependence types can also be easily handled with our representation. As an example, an incremental approach to modifying data dependences resulting from branch deletion or loop unrolling is introduced. The PDG supports incremental optimization, permitting transformations to be triggered by one another and applied only to affected dependences.

show abstract

Section: Node Splittingmentioning

confidence: 99%

Section: Introduction This Paper Introduces a Program Representationmentioning

confidence: 99%

The program dependence graph and its use in optimization

Ferrante

Ottenstein

Warren

1984

Lecture Notes in Computer Science

520

806

View full text Add to dashboard Cite

show abstract

“…This kind of anomaly, often called a data race, precludes the parallelization of the above loop. In the literature of compilation for parallel execution, a potential data race is referred to as a loop-carried dependence 3,34]. Without explicit synchronization, only loops with no carried dependences may be safely executed in parallel.…”

Section: Do I = 1 100 A(i) = A(50) + 1 Enddomentioning

confidence: 99%

“…Loop distribution separates independent statements inside a single loop into multiple loops with identical headers 3,34]. It is used to expose partial parallelism by separating statements which may be parallelized from those that must be executed sequentially.…”

Section: Loop Distributionmentioning

confidence: 99%

See 1 more Smart Citation

Analysis and transformation in an interactive parallel programming tool

Kennedy

McKinley

Tseng

1993

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

The ParaScope Editor is a new kind of interactive parallel programming tool for developing scienti c Fortran programs. It assists the knowledgeable user by displaying the results of sophisticated program analyses and by providing editing and a set of powerful interactive transformations. After an edit or parallelism-enhancing transformation, the ParaScope Editor incrementally updates both the analyses and source quickly. This paper describes the underlying implementation of the ParaScope Editor, paying particular attention to the analysis and representation of dependence information and its reconstruction after changes to the program.

show abstract

Business rule extraction techniques for COBOL programs

Huang

Tsai

Bhattacharya

et al. 1998

J. Softw. Maint: Res. Pract.

View full text Add to dashboard Cite

Business rules are operational rules, often coded into software, that business organizations follow to perform various activities, such as transaction processing, quality control, business planning and database management. Over time, business rules evolve and the software that implemented them are also changed and maintained. As the encompassing software becomes large and aged, the business rules embedded are difficult to extract and understand, evolving with the encompassing software over time. Furthermore, the encompassing software is changed without changing the corresponding text documents, and thus, often, the business organization trusts the code more than any other documents. This paper proposes several techniques to extract business rules from legacy code. It is possible to use a generic software maintenance tool to extract business rules; however this can be an expensive exercise. We propose a tailored solution approach for the business rule extraction (BRE) problem, which combines variable classifications, program slicing, heuristics for identifying slicing criteria, multiple representations of business rules, bottom-up data flow analysis and hierarchical abstraction, among other maintenance techniques. The proposed solution approach has been implemented as a system and successfully tried with a number of industrial programs.

show abstract

Dependence graphs and compiler optimizations

Cited by 514 publications

References 13 publications

The program dependence graph and its use in optimization

The program dependence graph and its use in optimization

Analysis and transformation in an interactive parallel programming tool

Business rule extraction techniques for COBOL programs

Contact Info

Product

Resources

About