Work

Dependence graphs and compiler optimizations

Year: 1981

Type: conference-paper

Abstract: Dependence graphs can be used as a vehicle for formulating and implementing compiler optimizations. This paper defines such graphs and discusses two kinds of transformations. The first are simple rewriting transformations that remove dependence arcs. The second are abstraction transformations that deal more globally with a dependence graph. These transformations have been implemented and applied to several different types of high-speed architectures.

Source: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)

DOI: 10.1145/567532.567555

Authors: D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, M. Wolfe

Institution: University of Illinois Urbana-Champaign

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Science Foundation

OpenAlex ID: W2043555680

FWCI: 8.692

Cites: 21

Cited by: 653

Related to: 10