The multi-queue replacement algorithm for second level uffer caches

Yuanyuan Zhou, James F. Philbin, Kai Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

248 Scopus citations

Abstract

This paper reports our research results that improve second level buffer cache performance. Several previous studies have shown that a good single leve cache replacement algorithm such as LRU does no work well with second level buffer caches. Second level buffer caches have different access pattern from first level buffer caches because Accesses to second level buffer caches are actually misses fro first leve buffer caches The paper presents our study of second level buffe cache access patterns using four large traces from various servers. We also introduce a new sec ond level buffer cache replacement algorithm called Multi-Queue (MQ). Our tracedriven simulation re sults show that MQ performs better than all seven tested alternatives. Our implementation on a rea storage system validates these results.

Original languageEnglish (US)
Title of host publicationProceedings of the 2001 USENIX Annual Technical Conference
PublisherUSENIX Association
ISBN (Electronic)188044609X, 9781880446096
StatePublished - 2001
Event2001 USENIX Annual Technical Conference - Boston, United States
Duration: Jun 25 2001Jun 30 2001

Publication series

NameProceedings of the 2001 USENIX Annual Technical Conference

Conference

Conference2001 USENIX Annual Technical Conference
CountryUnited States
CityBoston
Period6/25/016/30/01

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'The multi-queue replacement algorithm for second level uffer caches'. Together they form a unique fingerprint.

  • Cite this

    Zhou, Y., Philbin, J. F., & Li, K. (2001). The multi-queue replacement algorithm for second level uffer caches. In Proceedings of the 2001 USENIX Annual Technical Conference (Proceedings of the 2001 USENIX Annual Technical Conference). USENIX Association.