efficient data access management over flash memory storage systems
DESCRIPTION
Efficient Data Access Management over Flash Memory Storage Systems. Author : Chin-Hsien Wu Presenter : kilroy. Outline. Introduction Related work Motivation Main idea Evaluation Conclusion Q & A. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/1.jpg)
Author : Chin-Hsien Wu
Presenter : kilroy
![Page 2: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/2.jpg)
OutlineIntroductionRelated workMotivationMain ideaEvaluationConclusionQ & A
![Page 3: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/3.jpg)
IntroductionFlash memory is a popular alternative for the
design of storage systems for lots of reasons:Shock-resistantEnergy-efficient Non-volatile nature
This thesis focus on NAND flash because of :NAND flash is more suitable for designing file/storage
systems
Dr. Fujio Masuoka
![Page 4: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/4.jpg)
Related workFlash-memory characteristics
Write-once characteristic Size of Page/blockCumbrous overhead
Previous WorkGarbage collection Wear leavingEnergy consumption
![Page 5: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/5.jpg)
MotivationB-Tree is one of the popular data structures
adopted by database systemsHowever, a direct adoption of B-Tree could
exaggerate the overhead of flash management
![Page 6: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/6.jpg)
Main ideaThe design and implementation of BFTL:
![Page 7: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/7.jpg)
Main idea (cont.)Reservation Buffer:
Dirty records should be timely flushed to flash -> “index unit”
Index unit consists of : Original B-Tree component 、 identifier and
op_flagNote that BFTL use FTL to store index unitsIndex unit will pack into a logical term “sector”
![Page 8: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/8.jpg)
Main idea (cont.)The Commit Policy
Index units of the same node could be scattered over sectors
![Page 9: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/9.jpg)
![Page 10: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/10.jpg)
Main idea (cont.)Node translation table:
Sectors will scatter over flash memory
![Page 11: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/11.jpg)
![Page 12: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/12.jpg)
EvaluationExperiment setup and performance metrics
4 MB NAND flash Reservation buffer size : 60 recordThe bound of the lengths of lists in the node
translation table : 4
![Page 13: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/13.jpg)
Evaluation(cont.)Performance of B-Tree Index structures
creationThe workloads consisted of insertions onlyInserted 30000 records
![Page 14: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/14.jpg)
![Page 15: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/15.jpg)
Evaluation(cont.)Performance of B-Tree Index structures
maintenance
![Page 16: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/16.jpg)
Evaluation(cont.)Performance of B-Tree Index structures
search
![Page 17: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/17.jpg)
Evaluation(cont.)The size of reservation buffer and energy
consumption issues
![Page 18: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/18.jpg)
Evaluation(cont.)The size of reservation buffer and energy
consumption issues
![Page 19: Efficient Data Access Management over Flash Memory Storage Systems](https://reader036.vdocuments.site/reader036/viewer/2022062807/568151a3550346895dbfd38d/html5/thumbnails/19.jpg)
ConclusionOriginal B-Tree not suitable over flash
memoryHowever, a BFTL implement doing well on
flash memory