Sciweavers

19 search results - page 4 / 4
» Lightweight reference affinity analysis
Sort
View
POPL
2007
ACM
14 years 5 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
HT
2006
ACM
13 years 11 months ago
Just-in-time recovery of missing web pages
We present Opal, a light-weight framework for interactively locating missing web pages (http status code 404). Opal is an example of “in vivo” preservation: harnessing the col...
Terry L. Harrison, Michael L. Nelson
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 5 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ASPLOS
2009
ACM
14 years 5 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz