A Durable Flash Memory Search Tree
James Clay III, Kevin Wortman
TL;DR
This paper introduces the FM Tree, a flash memory-optimized search tree that significantly extends flash memory lifespan while maintaining efficient logarithmic search operations.
Contribution
The paper presents a novel flash memory-specific search tree design that greatly improves durability without sacrificing search efficiency.
Findings
FM Tree extends flash memory lifespan by 27 to 70 times.
Supports logarithmic-time search operations.
Demonstrates practical benefits for operating systems and databases.
Abstract
We consider the task of optimizing the B-tree data structure, used extensively in operating systems and databases, for sustainable usage on multi-level flash memory. Empirical evidence shows that this new flash memory tree, or FM Tree, extends the operational lifespan of each block of flash memory by a factor of roughly 27 to 70 times, while still supporting logarithmic-time search tree operations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Distributed and Parallel Computing Systems · Cloud Computing and Resource Management