Computer Science ›› 2010, Vol. 37 ›› Issue (3): 36-41.
Previous Articles Next Articles
MENG Xiao-xuan,SI Cheng-xiang,LIU Zhen-han,XU Lu
Online:
Published:
Abstract: This paper analyzed the performance characteristics of classic 2Q algorithm when it was performed on mail-service workloads,and proposed an improved algorithm, called 2Q*.The simulation results show that 2Q* algorithm can outperform the other replacement algorithms,including the classic 2Q algorithm,for all the cache sizes and various mail-service workloads. To verify the simulation results in real practice, we implemented the algorithm in FIexiCache, a partitioned buffer cache system, and integrated it with a popular adaptive sectuential prefect policy properly. The experiment results in real system further confirm the effectiveness of 2Q* algorithm for mail service kind of applications in improving their physical I/O performance. Moreover, its runtime overhead is also fairly low.
Key words: Buffer cache, Mail service, Replacement algorithm, 2Q*
MENG Xiao-xuan,SI Cheng-xiang,LIU Zhen-han,XU Lu. Replacement Algorithm Improved on 2Q* for Mail Service Workload and its Application in Storage Cache[J].Computer Science, 2010, 37(3): 36-41.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I3/36
Cited