Keywords (1)

Using Disjoint Reachability for Parallelization

Using Disjoint Reachability for Parallelization,10.1007/978-3-642-19861-8_12,James Christopher Jenista,Yong Hun Eom,Brian Demsky

Using Disjoint Reachability for Parallelization  
BibTex | RIS | RefWorks Download
We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap node is annotated with a set of reachability states that abstract the reachability of objects represented by the node. The analysis also includes a global pruning step which analyzes a reachability graph to prune imprecise reachability states that cannot be removed with local reasoning alone. We have implemented the analysis and used it to parallelize 8 benchmarks. Our evaluation shows the analysis results are sufficiently precise to parallelize our benchmarks and achieve an average speedup of 16.9× .
Conference: Compiler Construction - CC , pp. 198-224, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.