PWLRU: a buffer replacement algorithm for flash-based Database
Chen Gang · Journal of Zhejiang University(Engineering Science) · 2010
Studied the buffer page replacement methods on flash-based database,in order to address the performance inadequacy of the current methods therein.Proposed a new buffer page replacement algorithm named page-weight-least-recent-used(PWLRU),based on the characteristic analysis of the I/O and the flash media in OLTP application.PWLRU algorithm set sdefault reserved weight for each page in the buffer,and adjusts the weight when the corresponding page is scanned or modified,furthermore,the page with weight zero will be evicted from the buffer.The simulation conducted on the TPC-C benchmark and MYSQL database indicated that PWLRU are more efficient on both energy costs and I/O performance than the traditional least-recent-used(LRU)and clean-first-least-recent-used(CFLRU),which is tailored for the embedded flash environment.Therefore,PWLRU algorithm is suitable for page replacement in flashbased database management system