Sciweavers

71 search results - page 10 / 15
» Predictive Sequential Associative Cache
Sort
View
ICS
2003
Tsinghua U.
14 years 19 days ago
Inferential queueing and speculative push for reducing critical communication latencies
Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of Inferentially...
Ravi Rajwar, Alain Kägi, James R. Goodman
INFOCOM
1992
IEEE
13 years 11 months ago
An Assessment of State and Lookup Overhead in Routers
The current Internet is based on a stateless (datagram) architecture. However, many recent proposals rely on the maintenance of state information within network routers, leading t...
Deborah Estrin, Danny J. Mitzel
ISCA
2000
IEEE
121views Hardware» more  ISCA 2000»
13 years 11 months ago
Selective, accurate, and timely self-invalidation using last-touch prediction
Communication in cache-coherent distributed shared memory (DSM) often requires invalidating (or writing back) cached copies of a memory block, incurring high overheads. This paper...
An-Chow Lai, Babak Falsafi
SIGIR
2012
ACM
11 years 9 months ago
Search, interrupted: understanding and predicting search task continuation
Many important search tasks require multiple search sessions to complete. Tasks such as travel planning, large purchases, or job searches can span hours, days, or even weeks. Inev...
Eugene Agichtein, Ryen W. White, Susan T. Dumais, ...
CC
2010
Springer
190views System Software» more  CC 2010»
14 years 2 months ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...