Publications

Export 5 results:
Sort by: Author Title Type [ Year  (Asc)]
1998
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.

2002
Paleri, VK.  2002.  Automatic Generation of Code Optimizers from Formal Specifications. The Compiler Design Handbook. :61-97. Abstract

Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this function of the compiler. This article presents the development of a code transformation system, specifically for scalar transformations, which can be used either as a tool to assist the generation of code transformers or as an environment for experimentation with code transformations. The system is unique of its kind, providing a complete environment in which one can specify a transformation using dependence relations - in the specification language we have designed, generate code for a transformer from its specification, and experiment with the generated transformers on real-world programs.

2003
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.

2014
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
Saleena, N, Paleri VK.  2014.  A Simple Algorithm for Global Value Numbering, 09/16. :arXiv:1303.1880v2., Calicut: National Institute of Technology gvn.pdf