关键词: ELRUK 量化 LRU-k 缓冲

Abstract:

LRU-k is one of the most widely applied page-replacement algorithms in the modem operating systems and database systems. However, with the increment o  f the number of secondary storage devices having different read-write speeds in the system, the drawback of LRU- k that only the frequency of recent pag e references is taken into account to predict the hot pages in the near future is coming up. In this paper, a quantization algorithm named ELRUK is prop osed for page replacement. The algorithm combines another page attribute with the frequency of recent page references to evaluate the quantization value  for eliminating cost and picks up the minimum one for elimination. The fact that ELRUK quantization model is commonly used for a system with different   kinds of secondary storage devices demonstrates that LRU- k is just a particular form of ELRUK. Multi-heap and Hash table are used in the algorithm to i   mprove the efficiency. The experimen- tal results show that ELRU2 reduces the read-write time by 15-30M, compared with LRU-2.

Key words: ELRUK, quantization, LRU- k, buffer