Using Disjoint Reachability for Parallelization

Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap 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×.

• Type: Journal
• Year: 2011
• Where: CC
• Authors: James Christopher Jenista, Yong Hun Eom, Brian Demsky
• Keywords: CC 2011, Reachability Analysis, Reachability Graph, Speedup, System Software