ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Improving Flow-Insensitive Solutions for Non-Separable Dataflow Problems

Roy, Subhajit and Srikant, YN (2008) Improving Flow-Insensitive Solutions for Non-Separable Dataflow Problems. In: Proceedings of the 2008 ACM symposium on Applied computing . pp. 211-216.

[img] PDF
9.pdf - Published Version
Restricted to Registered users only

Download (297kB) | Request a copy
Official URL: http://portal.acm.org/citation.cfm?doid=1363686.13...


Flow-insensitive solutions to dataflow problems have been known to be highly scalable; however also hugely imprecise. For non-separable dataflow problems this solution is further degraded due to spurious facts generated as a result of dependence among the dataflow facts. We propose an improvement to the standard flow-insensitive analysis by creating a generalized version of the dominator relation that reduces the number of spurious facts generated. In addition, the solution obtained contains extra information to facilitate the extraction of a better solution at any program point, very close to the flow-sensitive solution. To improve the solution further, we propose the use of an intra-block variable renaming scheme. We illustrate these concepts using two classic non-separable dataflow problems --- points-to analysis and constant propagation.

Item Type: Journal Article
Publication: Proceedings of the 2008 ACM symposium on Applied computing
Publisher: Association for Computing Machinery
Additional Information: Copyright of this article belongs to Association for Computing Machinery.
Keywords: Compilers; Dataflow Analysis; Compiler Optimizations.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 25 Aug 2009 11:16
Last Modified: 19 Sep 2010 05:42
URI: http://eprints.iisc.ac.in/id/eprint/22467

Actions (login required)

View Item View Item