repository
Log-Buffer Aware Cache Replacement Policy for Flash Storage Devices
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Tae-Sun Chung | - |
| dc.contributor.author | ANWAR, USMAN | - |
| dc.date.accessioned | 2018-11-08T08:17:39Z | - |
| dc.date.available | 2018-11-08T08:17:39Z | - |
| dc.date.issued | 2016-08 | - |
| dc.identifier.other | 22949 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/12471 | - |
| dc.description | 학위논문(석사)--아주대학교 일반대학원 :컴퓨터공학과,2016. 8 | - |
| dc.description.tableofcontents | CHAPTER 1. Introduction 1 CHAPTER 2. Background and Related Work 5 2.1 Background 5 2.1.1 System Architecture of Flash Memory 5 2.1.2 Log Buffer-Based FTLs 12 2.1.3 Flash-Aware Buffer Schemes 14 CHAPTER 3. Log-buffer Aware Cache-replacement Scheme 19 3.1 Overview 19 3.2 Page Eviction Rules 21 3.3 Description 22 CHAPTER 4. Simulation 26 4.1 Experimental setup 26 4.2 Results Evaluation 28 4.2.1 Number of write operations 28 4.2.2 Average associativity 31 4.2.3 Number of switch operations 32 4.2.4 Number of cache hits 33 CONCLUSION 34 REFERENCES 35 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | Log-Buffer Aware Cache Replacement Policy for Flash Storage Devices | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.department | 일반대학원 컴퓨터공학과 | - |
| dc.date.awarded | 2016. 8 | - |
| dc.description.degree | Master | - |
| dc.identifier.localId | 758638 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000022949 | - |
| dc.subject.keyword | flash memory | - |
| dc.subject.keyword | cache management | - |
| dc.subject.keyword | page replacement policy | - |
| dc.subject.keyword | flash translation layer | - |
| dc.subject.keyword | embedded devices | - |
| dc.description.alternativeAbstract | In recent times, flash memory has been widely used in embedded devices and enterprise computing environments because of its many advantages, which includes shock resistance, low energy consumption, non-volatile nature and high I/O speed. However, flash memory hardware also possesses characteristics such as erase-before write, a limited number of erase cycles and asymmetric I/O costs among read, write, and erase operations, where the cost of write and erase operations are much higher than that of read operations. Hence, there is the need for the cache-replacement policy in flash-based systems to consider the asymmetric I/O costs. Previous studies on cache management including least recently used (LRU), clean-first LRU (CFLRU) and cold clean-first LRU (CCF-LRU) focused mainly on to reducing the write access to flash memory by evicting clean pages before dirty pages, and they do not consider how the evicted page would be treated by the flash memory. This resulted in performance degradation. Flash aware buffer-management (FAB) tries to evict pages considering the inner structure of flash memory but there are problems related to the high cache-miss ratio and the generation of a large number of write operations to the flash memory. In this paper, we propose a log-buffer aware (LBA) cache-replacement policy that not only tries to reduce the number of write accesses to flash memory as well as the high cache hit ratio, but also evicts pages while considering the log-block associativity problem of log-based flash translation layers (FTLs). Experimental results show that compare to previous studies, the proposed cache-replacement policy is more effective for higher cache-hit ratio and for reducing the garbage-collection overhead of flash memory by increasing the partial merge and switch operations. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Computer Engineering > 3. Theses(Master)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,350,688
- Total Download :1,746
- Today View :4,848
