repository
순환 저장 방식에 기반한 콜드 블록 그룹핑
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 정태선 | - |
| dc.contributor.author | 최미진 | - |
| dc.date.accessioned | 2018-11-08T08:10:11Z | - |
| dc.date.available | 2018-11-08T08:10:11Z | - |
| dc.date.issued | 2017-02 | - |
| dc.identifier.other | 24918 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/11062 | - |
| dc.description | 학위논문(석사)--아주대학교 일반대학원 :컴퓨터공학과,2017. 2 | - |
| dc.description.tableofcontents | 1. Introduction 2. Background and related work 2.1 Flash memory 2.2 FLASH TRANSLATION LAYER (FTL) 2.3 FTL algorithms 2.3.1 Page level Mapping Scheme 2.3.2 Block Level Mapping Scheme 2.3.3 BAST (Block Associative Sector Translation) 2.3.4 FAST (Fully Associative Sector Translation) 3. Motivation 3.1 In-Page Logging (IPL) 3.2 GRR (Group Round Robin) Scheme 4. Suggested algorithm 4.1 Write operation 4.2 Read operation 4.3 Erase operation 5. Performance evaluation 5.1 Write operation 5.2 Erase operation 6. Conclusion and future work References | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | 순환 저장 방식에 기반한 콜드 블록 그룹핑 | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.department | 일반대학원 컴퓨터공학과 | - |
| dc.date.awarded | 2017. 2 | - |
| dc.description.degree | Master | - |
| dc.identifier.localId | 770427 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000024918 | - |
| dc.subject.keyword | wear leveling | - |
| dc.description.alternativeAbstract | Flash memory is light, portable, dealing with tasks fast and has good durability, so that so far it is considered as a best substitute for hard-disk. However, it has a disadvantage of an asymmetrical speed in reading, writing and erasing, and has limits to the number of erasing, and if one does not stay loyal to the limits, the life of memory would be reduced. When data is managed as modifications of small units in a file system and a database system by applying a flash memory, frequent write and erase operations are frequently performed in data blocks. To prevent this, in this paper, we apply the existing IPL (In-Page Logging) to manage the modifications of small units efficiently and group hot data, cold data and other data blocks together to form a Round Robin based storage algorithm. | - |
- 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,550,725
- Total Download :1,795
- Today View :13,090
