Sciweavers

1265 search results - page 199 / 253
» Performance Measurement of Interpreted Programs
Sort
View
ISPASS
2008
IEEE
14 years 3 months ago
Pinpointing and Exploiting Opportunities for Enhancing Data Reuse
—The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than me...
Gabriel Marin, John M. Mellor-Crummey
PPPJ
2009
ACM
14 years 1 months 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
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 10 days ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ASPLOS
2009
ACM
14 years 9 months ago
RapidMRC: approximating L2 miss rate curves on commodity systems for online optimizations
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
David K. Tam, Reza Azimi, Livio Soares, Michael St...
ASPLOS
2009
ACM
14 years 9 months ago
Phantom-BTB: a virtualized branch target buffer design
Modern processors use branch target buffers (BTBs) to predict the target address of branches such that they can fetch ahead in the instruction stream increasing concurrency and pe...
Ioana Burcea, Andreas Moshovos