Sciweavers

88 search results - page 6 / 18
» Outperforming LRU with an Adaptive Replacement Cache Algorit...
Sort
View
INFOCOM
2003
IEEE
15 years 4 months ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
ISCA
2007
IEEE
177views Hardware» more  ISCA 2007»
15 years 5 months ago
Adaptive insertion policies for high performance caching
The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applica...
Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, ...
WWW
2003
ACM
15 years 11 months ago
Architecture of a quality based intelligent proxy (QBIX) for MPEG-4 videos
Due to the increasing availability and use of digital video data on the Web, video caching will be an important performance factor in the future WWW. We propose an architecture of...
Peter Schojer, László Böszö...
NCA
2003
IEEE
15 years 4 months ago
Web Proxy Cache Replacement: Do's, Don'ts, and Expectations
Numerous research efforts have produced a large number of algorithms and mechanisms for web proxy caches. In order to build powerful web proxies and understand their performance, ...
Peter Triantafillou, Ioannis Aekaterinidis
INFOCOM
2006
IEEE
15 years 4 months ago
Proportional Replication in Peer-to-Peer Networks
— We recently showed for peer-to-peer networks, that having the number of replicas of each object proportional to the request rate for these objects has many per-node advantages....
Saurabh Tewari, Leonard Kleinrock