2010 IEEE 30th International Conference on Distributed Computing Systems 2010
DOI: 10.1109/icdcs.2010.26
|View full text |Cite
|
Sign up to set email alerts
|

A New Buffer Cache Design Exploiting Both Temporal and Content Localities

Abstract: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as reference blocks that are not only accessed frequently but also identical or similar in content to other blocks that are being accessed. Fast delta compression and decompression are used to satisfy as many I/O requests as possible using the popular reference blocks together with small deltas inside the buffer cache. The popularity of a ref… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Other studies utilize data deduplication technology to improve I/O performance. The I/O Deduplication [Koller and Rangaswami 2010] and LPU [Ren and Yang 2010] schemes use the combined content-based and sector-based cache to improve I/O performance. SAR, being independent of and orthogonal to any specific data deduplication scheme, can be easily incorporated into any of them to improve their read performance.…”
Section: Related Workmentioning
confidence: 99%
“…Other studies utilize data deduplication technology to improve I/O performance. The I/O Deduplication [Koller and Rangaswami 2010] and LPU [Ren and Yang 2010] schemes use the combined content-based and sector-based cache to improve I/O performance. SAR, being independent of and orthogonal to any specific data deduplication scheme, can be easily incorporated into any of them to improve their read performance.…”
Section: Related Workmentioning
confidence: 99%
“…In this case, SSDs does not handle random writes. Ren et al [29] introduced a new caching algorithm that exploits content locality of I/O requests to reduce SSD cache's write pressure.…”
Section: Related Workmentioning
confidence: 99%
“…SEQ [21] At program context level Program Counter Based Classification (PCC) [7] and Adaptive Multi Policy caching (AMP) [S] exploited the program counter exhibited in the application binary code for accurately identitying the access pattern and enhancing the cache performance.…”
Section: A Reference Pattern Based Techniquesmentioning
confidence: 99%