A simple algorithm for partial redundancy elimination

Paleri, Vineeth Kumar and Srikant, YN and Shankar, Priti (1998) A simple algorithm for partial redundancy elimination. In: ACM Sigplan Notices, 33 (12). pp. 35-43.

PDF A_Simple_Algorithm.pdf - Published Version Restricted to Registered users only Download (686kB) | Request a copy

Abstract

Partial redundancy elimination was originally formulated as a bidirectional, bit-vector, data-flow analysis problem by Morel and Renvoise. Dhamdhere improved the original algorithm using the concept of edge placement. Knoop, Ruthing, and Steffen viewed the problem within a framework that required only four unidirectional analyses for an optimal solution. Here, we propose an algorithm for partial redundancy elimination based on well known concepts, viz., availability, anticipability, partial availability, and partial anticipability. The algorithm is both computationally and lifetime optimal. Our algorithm also requires four unidirectional data-flow analyses. The main advantage of the algorithm is its simplicity

Item Type:	Journal Article
Publication:	ACM Sigplan Notices
Publisher:	Association for Computing Machinery
Additional Information:	Copyright of this article belongs to Association for Computing Machinery.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	27 Nov 2009 05:24
Last Modified:	19 Sep 2010 04:59
URI:	http://eprints.iisc.ac.in/id/eprint/18072

Actions (login required)

View Item