1 / 19

Efficient Data Access Management over Flash Memory Storage Systems

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.

trish
Télécharger la présentation

Efficient Data Access Management over Flash Memory Storage Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Efficient Data Access Management over Flash Memory Storage Systems Author : Chin-Hsien Wu Presenter : kilroy

  2. Outline • Introduction • Related work • Motivation • Main idea • Evaluation • Conclusion • Q & A

  3. Introduction • Flash memory is a popular alternative for the design of storage systems for lots of reasons: • Shock-resistant • Energy-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

  4. Related work • Flash-memory characteristics • Write-once characteristic • Size of Page/block • Cumbrous overhead • Previous Work • Garbage collection • Wear leaving • Energy consumption

  5. Motivation • B-Tree is one of the popular data structures adopted by database systems • However, a direct adoption of B-Tree could exaggerate the overhead of flash management

  6. Main idea • The design and implementation of BFTL:

  7. 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_flag • Note that BFTL use FTL to store index units • Index unit will pack into a logical term “sector”

  8. Main idea (cont.) • The Commit Policy • Index units of the same node could be scattered over sectors

  9. Main idea (cont.) • Node translation table: • Sectors will scatter over flash memory

  10. Evaluation • Experiment setup and performance metrics • 4 MB NAND flash • Reservation buffer size : 60 record • The bound of the lengths of lists in the node translation table : 4

  11. Evaluation(cont.) • Performance of B-Tree Index structures creation • The workloads consisted of insertions only • Inserted 30000 records

  12. Evaluation(cont.) • Performance of B-Tree Index structures maintenance

  13. Evaluation(cont.) • Performance of B-Tree Index structures search

  14. Evaluation(cont.) • The size of reservation buffer and energy consumption issues

  15. Evaluation(cont.) • The size of reservation buffer and energy consumption issues

  16. Conclusion • Original B-Tree not suitable over flash memory • However, a BFTL implement doing well on flash memory

More Related