Paleri, VK and Srikant, YN and Shankar, P (2003) Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm. In: Science of Computer Programming, 48 (1). pp. 1-20.
165sdarticle.pdf - Published Version
Restricted to Registered users only
Download (165Kb) | Request a copy
We propose a new algorithm for partial redundancy elimination based on the new concepts of Safe partial availability and safe partial anticipability. These new concepts are derived by the integration of the notion of safety into the definitions of partial availability and partial anticipability. The algorithm works on flow graphs whose nodes are basic blocks. It is both computationally and lifetime optimal and requires four unidirectional analyses. The most important feature of the algorithm is its simplicity; the algorithm evolves naturally from the new concept of safe partial availability.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier.|
|Keywords:||Computational optimality;Data-flow analysis;Flow graphs;Lifetime optimality;Partial redundancy elimination|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||26 Sep 2006|
|Last Modified:||08 Jul 2011 10:55|
Actions (login required)