Development of Flash Memory Page Management Techniques
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Many studies on flash memory-based buffer replacement algorithms that consider the characteristics of flashmemory have recently been developed. Conventional flash memory-based buffer replacement algorithmshave the disadvantage that the operation speed slows down, because only the reference is checked whenselecting a replacement target page and either the reference count is not considered, or when the referencetime is considered, the elapsed time is considered. Therefore, this paper seeks to solve the problem ofconventional flash memory-based buffer replacement algorithm by dividing pages into groups andconsidering the reference frequency and reference time when selecting the replacement target page. Inaddition, because flash memory has a limited lifespan, candidates for replacement pages are selected based onthe number of deletions.
Abstract
Many studies on flash memory-based buffer replacement algorithms that consider the characteristics of flashmemory have recently been developed. Conventional flash memory-based buffer replacement algorithmshave the disadvantage that the operation speed slows down, because only the reference is checked whenselecting a replacement target page and either the reference count is not considered, or when the referencetime is considered, the elapsed time is considered. Therefore, this paper seeks to solve the problem ofconventional flash memory-based buffer replacement algorithm by dividing pages into groups andconsidering the reference frequency and reference time when selecting the replacement target page. Inaddition, because flash memory has a limited lifespan, candidates for replacement pages are selected based onthe number of deletions.
참고문헌 (13)
- S. Ahn, "A compressed file system manager for flash memory based consumer electronics devices", Journal of IEEE Transactions on Consumer Electronics, 59(3), pp.544~549 (2013)[DOI]
- H. Li, "Energy-aware flash memory management in virtual memory system", Journal of IEEE Transactions on Very Large Scale Integration Systems, 16(8), pp.952~964 (2008)[DOI]
- A. Dan, "An approximate analysis of the LRU and FIFO buffer replacement schemes", Proceedings of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp.143~152 (1990)
- S. Jiang, "CLOCK-Pro: an effective improvement of the CLOCK replacement", Proceeding of the USENIX Annual Technical Conference, pp.323~336 (2005)
- S. Jiang, "LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance", Proceeding of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp.31~42 (2002)
- T. Johnson, "2Q: a low overhead high performance buffer management replacement algorithm", Proceeding of the 20th International Conference on Very Large Data Bases, pp.439~450 (1994)
- E. O'Neil, "The LRU-K page replacement algorithm for database disk buffering", Proceeding of ACM SIGMOD International Conference on Management of Data, pp.297~306 (1993)
- H. Jung, "LRU-WSR: integration of LRU and writes sequence recording for flash memory", Journal of IEEE Transactions on Consumer Electronics, 54(3), pp.1215~1223 (2012)
- Z. Li, "CCF-LRU: a new buffer replacement algorithm for flash memory", Journal of IEEE Transactions on Consumer Electronics, 55(3), pp.1351~1359 (2009)[DOI]
- S. Y. Park, "CFLRU: a replacement algorithm for flash memory", Proceeding of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems, pp.234~241 (2006)
- G. Xu, "CLRU: a new page replacement algorithm for NAND flash-based consumer electronics", Journal of IEEE Transactions on Consumer Electronics, 60(1), pp.38~44 (2014)[DOI]
- M. Lin, "HDC: an adaptive buffer replacement algorithm for NAND flash memory-based databases", Optik-International Journal for Light and Electron Optics, 125(3), pp.1167~1173 (2014)[DOI]
- X. Su, "Flash-DBSim: a simulation tool for evaluating flash-based database algorithms", Proceedings of International Conference on Computer Science and Information Technology, pp.185~189 (2009)