Sciweavers

268 search results - page 37 / 54
» Automated Analysis of Data-Dependent Programs with Dynamic M...
Sort
View
PLDI
2010
ACM
14 years 17 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
WCRE
2010
IEEE
13 years 5 months ago
Immediacy through Interactivity: Online Analysis of Run-time Behavior
—Visualizations of actual run-time data support the comprehension of programs, like examples support the ion of abstract concepts and principles. Unfortunately, the required run-...
Michael Perscheid, Bastian Steinert, Robert Hirsch...
PPPJ
2009
ACM
14 years 5 days ago
Virtual reuse distance analysis of SPECjvm2008 data locality
Reuse distance analysis has been proved promising in evaluating and predicting data locality for programs written in Fortran or C/C++. But its effect has not been examined for ap...
Xiaoming Gu, Xiao-Feng Li, Buqi Cheng, Eric Huang
PPOPP
2011
ACM
12 years 10 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
TPHOL
2007
IEEE
14 years 1 months ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík