Name
Abstract | ||
|---|---|---|
Most traditional cooperative caching schemes were developed for network file systems but were not designed for cluster-based web servers with content-based request distribution. Hence, although the schemes are applied to the web servers, their performance is not good due to high disk accesses and large block access latency. This paper proposes and evaluates a new cooperative caching scheme suitable to file systems in web servers. It uses a cache replacement policy, called duplicate first copy replacement, to avoid caching unnecessary data produced during serving requests and to minimize disk accesses. In addition it reduces block access latency required to fetch a file-block in the cooperative cache. A simulation shows that our cooperating caching decreases the disk access ratio by 29%, and reduces block access latency by about 26% when compared to the existing cooperative algorithms. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/S0164-1212(03)00068-2 | Journal of Systems and Software |
Keywords | Field | DocType |
cooperative cache,network file system,cluster-based web server,block access latency,cooperative caching,web server,high disk access,new cooperative caching scheme,existing cooperative algorithm,disk access,content-aware cooperative caching,traditional cooperative caching scheme,content-based request distribution,large block access latency,disk access ratio | Cache,Computer science,Latency (engineering),Server,Real-time computing,False sharing,Smart Cache,Network File System,Web server | Journal |
Volume | Issue | ISSN |
69 | 1-2 | The Journal of Systems & Software |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Woo Hyun Ahn | 1 | 10 | 3.97 |
| Woo Jin Kim | 2 | 10 | 1.88 |
| Daeyeon Park | 3 | 161 | 27.12 |