TL: A high performance buffer replacement strategy for read-write splitting web applications

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the quickly increasing pressure of users' requests, more and more Web applications adopt the read-write splitting to improve the performance, which requires new buffer replacement strategy. Flash memory has emerged as a popular storage media, and we use it to replace hard disk for read-write splitting Web applications. Traditional buffer replacement strategies are suboptimal on flash memory, since flash memory has some distinguished features as out-of-place update and read-write asymmetry. In this paper, we design a flash-aware buffer replacement strategy Tri-List (TL), which emphasizes the I/O asymmetry of flash memory. Unlike other flash-aware buffer replacement policies which are based on LRU method, TL considers both recency and frequency of page requests to make better decision of buffer replacement. Experimental results on both synthetic and benchmarking traces shows that TL has up to 30.3% improvements than state-of-the-art flash-aware buffer management policies. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Jiang, Z., Zhang, Y., Wang, J., Li, C., & Xing, C. (2014). TL: A high performance buffer replacement strategy for read-write splitting web applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8709 LNCS, pp. 478–484). Springer Verlag. https://doi.org/10.1007/978-3-319-11116-2_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free