Efficient replacement of nonuniform objects in web caches

Hyokyung Bahn; Kern Koh; Sam H. Noh; Min Sang Lyul

doi:10.1109/MC.2002.1009170

Efficient replacement of nonuniform objects in web caches

Hyokyung Bahn, Kern Koh, Sam H. Noh, Min Sang Lyul

Department of Computer Science & Engineering

Research output: Contribution to specialist publication › Article

82 Scopus citations

Abstract

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. This paper presents the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments.

Original language	English
Pages	65-73
Number of pages	9
Volume	35
No	6
Specialist publication	Computer
DOIs	https://doi.org/10.1109/MC.2002.1009170
State	Published - Jun 2002

Bibliographical note

Funding Information:
We thank NLANR and DEC for making their proxy traces available; without their generosity, this work would not exist. Many thanks also to the reviewers for their constructive and enlightening comments. This article was supported in part by Korea’s Ministry of Education under the Brain Korea 21 program and by the Ministry of Science and Technology under the National Research Laboratory program.

Access to Document

10.1109/MC.2002.1009170

Cite this

@misc{6b3e1a83923a4e86a268817ce0471a01,

title = "Efficient replacement of nonuniform objects in web caches",

abstract = "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. This paper presents the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments.",

author = "Hyokyung Bahn and Kern Koh and Noh, {Sam H.} and {Sang Lyul}, Min",

note = "Funding Information: We thank NLANR and DEC for making their proxy traces available; without their generosity, this work would not exist. Many thanks also to the reviewers for their constructive and enlightening comments. This article was supported in part by Korea{\textquoteright}s Ministry of Education under the Brain Korea 21 program and by the Ministry of Science and Technology under the National Research Laboratory program.",

year = "2002",

month = jun,

doi = "10.1109/MC.2002.1009170",

language = "English",

volume = "35",

pages = "65--73",

journal = "Computer",

issn = "0018-9162",

publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Efficient replacement of nonuniform objects in web caches

AU - Bahn, Hyokyung

AU - Koh, Kern

AU - Noh, Sam H.

AU - Sang Lyul, Min

N1 - Funding Information: We thank NLANR and DEC for making their proxy traces available; without their generosity, this work would not exist. Many thanks also to the reviewers for their constructive and enlightening comments. This article was supported in part by Korea’s Ministry of Education under the Brain Korea 21 program and by the Ministry of Science and Technology under the National Research Laboratory program.

PY - 2002/6

Y1 - 2002/6

N2 - 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. This paper presents the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments.

AB - 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. This paper presents the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments.

UR - http://www.scopus.com/inward/record.url?scp=0036602265&partnerID=8YFLogxK

U2 - 10.1109/MC.2002.1009170

DO - 10.1109/MC.2002.1009170

M3 - Article

AN - SCOPUS:0036602265

SN - 0018-9162

VL - 35

SP - 65

EP - 73

JO - Computer

JF - Computer

ER -

Efficient replacement of nonuniform objects in web caches

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this