AN ELIMINATION ALGORITHM FOR BIDIRECTIONAL-DATA FLOW PROBLEMS USING EDGE PLACEMENT

DHAMDHERE, DM
PATIL, H

Open link

Publication date

January 1993

DOI

10.1145/169701.169684

Publisher

Association for Computing Machinery (ACM)

Journal

ACM Transactions on Programming Languages and Systems

Abstract

Bidirectional data flow problems, useful in a wide range of optimizing transformations, are conventionally solved using the iterative approach. This paper shows that use of the edge placement technique makes bidirectional data flow problems amenable to efficient solution. An elimination algorithm for bidirectional data flow problems using edge placement is presented, and its complexity is shown to be identical to the complexity of elimination algorithms for unidirectional data flows

Extracted data

We use cookies to provide a better user experience.

Data Protection

AN ELIMINATION ALGORITHM FOR BIDIRECTIONAL-DATA FLOW PROBLEMS USING EDGE PLACEMENT

Abstract

Extracted data

AN ELIMINATION ALGORITHM FOR BIDIRECTIONAL-DATA FLOW PROBLEMS USING EDGE PLACEMENT

Abstract

Extracted data

Topics

Related items

Topics

Related items