Publications

Export 4 results:
Sort by: Author [ Title (Asc)] Type Year
A B C D E F G H I J K L M N O P Q R [S] T U V W X Y Z   [Show ALL]
G
Saleena, N, Paleri VK.  2014.  Global Value Numbering for Redundancy Detection: A Simple and Efficient Algorithm. Proceedings of the 29th Annual ACM Symposium on Applied Computing. :1609-1611., Korea: ACM
P
Paleri, VK, Srikant YN, Shankar P.  2003.  Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm. Sci. Comput. Program.. 48:1-20., Number 1 AbstractWebsite

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.

S
Saleena, N, Paleri VK.  2014.  A Simple Algorithm for Global Value Numbering, 09/16. :arXiv:1303.1880v2., Calicut: National Institute of Technology gvn.pdf
Paleri, VK, Srikant YN, Shankar P.  1998.  A Simple Algorithm for Partial Redundancy Elimination. SIGPLAN Notices. 33:35-43., Number 12 AbstractWebsite

The paper proposes 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. 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.