Modern applications make heavy use of third-party libraries and components, which poses new challenges for efficient dynamic dataflow analysis. To perform such analyses, transitive dependent components at all layers of the call stack must be monitored and analyzed, and as such may be prohibitively expensive for systems with large libraries and components. As an approach to address such expenses, we record, summarize, and reuse dynamic dataflows between inputs and outputs of components, based on dynamic control and data traces. These summarized dataflows are computed at a fine-grained instruction level; the result of which, we call “dynamic dependence summaries.” Although static summaries have been proposed, to the best of our knowledge, this work presents the first technique for dynamic dependence summaries. The benefits to efficiency of such summarization may be afforded with losses of accuracy. As such, we evaluate the degree of accuracy loss and the degree of efficiency gain when using dynamic dependence summaries of library methods. On five large programs from the DaCapo benchmark (for which no existing whole-program dynamic dependence analyses have been shown to scale) and 21 versions of NANOXML, the summarized dependence analysis provided 90% accuracy and a speedup of 100% (i.e., ×2), on average, when compared to traditional exhaustive dynamic dependence analysis.
vijaykrishna
agiats
rpc
hf149
matsuolab
.png){kind=avatar}
satai
masatoto
upura
trafficbrain
a1da4
itasohaakhib1
ryotoitoi
andyhume
sstephenson
jmmastey
sferik
samanthasiow
quramy
marktimemedia
shpigford
panda_program
keathley
honnibal
eileencodes
