This Article 
 Bibliographic References 
 Add to: 
Efficient Replacement of Nonuniform Objects in Web Caches
June 2002 (vol. 35 no. 6)
pp. 65-73
Kern Koh, Seoul National University
Sang Lyul Min, Seoul National University
Sam H. Noh, Hong-Ik University

Cache performance depends heavily on replacement algorithms, which dynamically select a suitable subset of objects for caching in a finite space. Developing such algorithms for wide-area distributed environments is challenging because, unlike traditional paging systems, retrieval costs and object sizes are not necessarily uniform.In a uniform caching environment, a replacement algorithm generally seeks to reduce cache misses, usually by replacing an object with the least likelihood of re-reference.In contrast, reducing total cost incurred due to cache misses is more important in nonuniform caching environments.

Hyokyung Bahn, Kern Koh, Sang Lyul Min, Sam H. Noh, "Efficient Replacement of Nonuniform Objects in Web Caches," Computer, vol. 35, no. 6, pp. 65-73, June 2002, doi:10.1109/MC.2002.1009170
Usage of this product signifies your acceptance of the Terms of Use.