PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory
NAND flash memory has many advantages, including a small form factor, non-volatility, and high reliability. However, problems caused by physical limitations, such as asymmetric I/O latencies and outof-place updates, still need to be resolved. By using a probability of reference (PR) to select a cand...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2017-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7971914/ |
| _version_ | 1818927956089634816 |
|---|---|
| author | Youwei Yuan Yeting Shen Wanqing Li Dongjin Yu Lamei Yan Yifei Wang |
| author_facet | Youwei Yuan Yeting Shen Wanqing Li Dongjin Yu Lamei Yan Yifei Wang |
| author_sort | Youwei Yuan |
| collection | DOAJ |
| description | NAND flash memory has many advantages, including a small form factor, non-volatility, and high reliability. However, problems caused by physical limitations, such as asymmetric I/O latencies and outof-place updates, still need to be resolved. By using a probability of reference (PR) to select a candidate page as the victim page, this paper presents a novel buffer replacement algorithm called PR least recently used to enhance the flash memory performance. To predict whether a page may be referenced in the future, three variables are used to calculate a page's PR. In addition, we improve the performance overhead of the number of write operations, the hit ratio, and the runtime using a novel PR strategy. The algorithm is implemented and tested on the flash simulation platform Flash-DBSim. The results indicate that our algorithm provides improvements of up to 7% for the hit ratio with an improvement of up to 36.7% for the overall runtime compared with other approaches. |
| first_indexed | 2024-12-20T03:21:15Z |
| format | Article |
| id | doaj.art-964c5e805c3046449eb58f32a5cc2fb7 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-20T03:21:15Z |
| publishDate | 2017-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-964c5e805c3046449eb58f32a5cc2fb72022-12-21T19:55:12ZengIEEEIEEE Access2169-35362017-01-015126261263410.1109/ACCESS.2017.27237587971914PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash MemoryYouwei Yuan0https://orcid.org/0000-0002-9431-5147Yeting Shen1Wanqing Li2Dongjin Yu3Lamei Yan4Yifei Wang5School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaNAND flash memory has many advantages, including a small form factor, non-volatility, and high reliability. However, problems caused by physical limitations, such as asymmetric I/O latencies and outof-place updates, still need to be resolved. By using a probability of reference (PR) to select a candidate page as the victim page, this paper presents a novel buffer replacement algorithm called PR least recently used to enhance the flash memory performance. To predict whether a page may be referenced in the future, three variables are used to calculate a page's PR. In addition, we improve the performance overhead of the number of write operations, the hit ratio, and the runtime using a novel PR strategy. The algorithm is implemented and tested on the flash simulation platform Flash-DBSim. The results indicate that our algorithm provides improvements of up to 7% for the hit ratio with an improvement of up to 36.7% for the overall runtime compared with other approaches.https://ieeexplore.ieee.org/document/7971914/Buffer replacement algorithmflash memoryflash-based DBMSprobability of reference |
| spellingShingle | Youwei Yuan Yeting Shen Wanqing Li Dongjin Yu Lamei Yan Yifei Wang PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory IEEE Access Buffer replacement algorithm flash memory flash-based DBMS probability of reference |
| title | PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory |
| title_full | PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory |
| title_fullStr | PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory |
| title_full_unstemmed | PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory |
| title_short | PR-LRU: A Novel Buffer Replacement Algorithm Based on the Probability of Reference for Flash Memory |
| title_sort | pr lru a novel buffer replacement algorithm based on the probability of reference for flash memory |
| topic | Buffer replacement algorithm flash memory flash-based DBMS probability of reference |
| url | https://ieeexplore.ieee.org/document/7971914/ |
| work_keys_str_mv | AT youweiyuan prlruanovelbufferreplacementalgorithmbasedontheprobabilityofreferenceforflashmemory AT yetingshen prlruanovelbufferreplacementalgorithmbasedontheprobabilityofreferenceforflashmemory AT wanqingli prlruanovelbufferreplacementalgorithmbasedontheprobabilityofreferenceforflashmemory AT dongjinyu prlruanovelbufferreplacementalgorithmbasedontheprobabilityofreferenceforflashmemory AT lameiyan prlruanovelbufferreplacementalgorithmbasedontheprobabilityofreferenceforflashmemory AT yifeiwang prlruanovelbufferreplacementalgorithmbasedontheprobabilityofreferenceforflashmemory |