3202 search results - page 466 / 641 » Memory access scheduling |
ICALP
2010
Springer
14 years 29 days ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
ISCA
1999
IEEE
14 years 13 days ago
1999
IEEE
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency. Jumppointers...
ECOOP
1999
Springer
14 years 13 days ago
1999
Springer
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic...
VTS
1999
IEEE
14 years 13 days ago
1999
IEEE
This paper presents a new technique for on-line consistency checking of embedded DRAMs. The basic idea is to use the periodic refresh operation for concurrently computing a test c...
ICS
1999
Tsinghua U.
14 years 13 days ago
1999
Tsinghua U.
A cache line size has a signi cant e ect on missrate and memorytra c. Today's computers use a xed line size, typically 32B, which may not be optimalfor a given application. O...