Sciweavers

Share
CGO
2013
IEEE

Query-directed adaptive heap cloning for optimizing compilers

6 years 7 months ago
Query-directed adaptive heap cloning for optimizing compilers
Andersen’s pointer analysis becomes more precise when applied with full heap cloning but unscalable for large, heapintensive programs. In contrast, k-callsite-sensitive heap cloning can be faster but less precise for some programs. In this paper, we make one step forward by enhancing Andersen’s analysis with QUery-Directed Adaptive (QUDA) heap cloning for optimizing compilers. The novelty of our analysis, called QUDA, lies in performing k-callsite-sensitive heap cloning iteratively, starting with ithout heap cloning), so that an abstract heap object is cloned at iteration k = i + 1 only if some mayalias queries that are not answered positively at iteration k = i may now be answered more precisely. QUDA, which is implemented in Open64, has the same precision as the state-of-the-art, FULCRA, a version of QUDA with exhaustive heap cloning, but is significantly more scalable. For 10 SPEC2000 C benchmarks and 5 C applications (totalling 840 KLOC) evaluated, QUDA takes only 4+ minutes ...
Yulei Sui, Yue Li, Jingling Xue
Added 27 Apr 2014
Updated 27 Apr 2014
Type Journal
Year 2013
Where CGO
Authors Yulei Sui, Yue Li, Jingling Xue
Comments (0)
books