Bio-Data
Professor, Department of Computer Science & Engg., IIT Bombay
Research
-
Research Areas
Have been working in the area of opimising compilers since 1989. Current
topics of interest are Generalised Data Flow Analysis, Compilation Issues
for Embedded Systems, and Register Allocation.
-
Past Research
A Generalised Theory of Exhaustive and Incremental Data Flow Analysis. This work
has provided
- First ever theoretical framework for handling bidirectional data flow
problems.
- A unified framework for handling unidirectional and bidirectional data
flow problems.
- A functional model for unidirectional and bidirectional incremental data flow
analysis.
- Efficient, simple, and generic algorithms for exhaustive and incremental
analysis of unidirectional and bidirectional flows.
- First ever complexity bounds for bidirectional data flows
- More precise and more general unified complexity bounds for
unidirectional and bidirectional data flows.
-
Current Research
- Automatic Construction of Code Optimisers : Design and implementation of
a language for specifying program transformation systems.
- Graph Density as a New Measure of Complexity of Data Flow Analysis.
This measure improves on the bound provided by Ken Kennedy in 1975.
- Truly bidirectional data flow analyses with applications to type
inferencing and units of measure analyses.
- Power analysis and optimization for embedded systems.
- Register Allocation.
-
Future Plans of Research
- Characterising non-singular data flow problems.
- Code partitioning for embedded processors.
- Bitwidth Analysis for Silicon Compilation.
- Optimization of predicated instruction.
Distinctions
Back to top of the page
Back to the main page
Last updated on 4 April 2003.