Sciweavers

127 search results - page 13 / 26
» Counter-Based Cache Replacement Algorithms
Sort
View
SYRCODIS
2008
95views Database» more  SYRCODIS 2008»
13 years 11 months ago
The Framework for Study Of Caching Algorithm Efficiency
In this paper we offer several models of reference sequences (traces of references) using Markov chains for testing of the replacement policies in caching systems. These models en...
Michael V. Grankov, Ngo Thanh Hung, Mosab Bassam Y...
POS
1994
Springer
14 years 1 months ago
Object Caching
With the emerging of 10 Gbps Ethernet, modern storage networks allow the hosts to access remote cache nearly as quickly as they can access from their local storages. Aiming at imp...
Alan Dearle
CN
2004
109views more  CN 2004»
13 years 9 months ago
Modeling correlations in web traces and implications for designing replacement policies
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...
Konstantinos Psounis, An Zhu, Balaji Prabhakar, Ra...
HPCA
2000
IEEE
14 years 2 months ago
Modified LRU Policies for Improving Second-Level Cache Behavior
Main memory accesses continue to be a significant bottleneck for applications whose working sets do not fit in second-level caches. With the trend of greater associativity in seco...
Wayne A. Wong, Jean-Loup Baer
USENIX
2000
13 years 11 months ago
Performing Replacement in Modem Pools
We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a repl...
Yannis Smaragdakis, Paul R. Wilson