Record Details

A fast algorithm for code movement optimisation

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A fast algorithm for code movement optimisation
 
Creator DHAMDHERE, DM
 
Subject program compilers
algorithms
optimisation
programming
 
Description Code optimisation algorithms using bi-directional data flow dependencies have become increasingly important in recent years. The use of these algorithms faces two difficulties in practice: (a) Low profitabilities, and (b) high solution costs. This paper develops a new approach to the use of bi-directional dependencies using the concept of edge placement. This is shown to yield higher profitabilities of optimisation. An efficient solution method for such algorithms is also developed. The complexity of this method is shown to be bounded by O(e) operations, where e is the number of edges in the program flow graph. Ths is comparable to the complexity of uni-directional flow algorithms commonly used in optimisation.
 
Publisher Association for Computing Machinery
 
Date 2009-07-04T05:56:09Z
2011-11-25T15:05:33Z
2011-12-26T13:04:37Z
2011-12-27T05:50:37Z
2009-07-04T05:56:09Z
2011-11-25T15:05:33Z
2011-12-26T13:04:37Z
2011-12-27T05:50:37Z
1988
 
Type Article
 
Identifier ACM SIGPLAN Notices 23(10), 172-180
0362-1340
http://dx.doi.org/10.1145/51607.51621
http://hdl.handle.net/10054/1590
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1590
 
Language en