Record Details

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

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title AN ELIMINATION ALGORITHM FOR BIDIRECTIONAL-DATA FLOW PROBLEMS USING EDGE PLACEMENT
 
Creator DHAMDHERE, DM
PATIL, H
 
Subject strength reduction transformation
global program optimization
usually linear algorithm
algorithms
bidirectional dependencies
data flow analysis
elimination algorithm
interval analysis
 
Description 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.
 
Publisher ASSOC COMPUTING MACHINERY
 
Date 2011-07-18T19:57:01Z
2011-12-26T12:50:48Z
2011-12-27T05:36:54Z
2011-07-18T19:57:01Z
2011-12-26T12:50:48Z
2011-12-27T05:36:54Z
1993
 
Type Article
 
Identifier ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 15(2), 312-336
0164-0925
http://dx.doi.org/10.1145/169701.169684
http://dspace.library.iitb.ac.in/xmlui/handle/10054/5046
http://hdl.handle.net/10054/5046
 
Language en