Soft lists: a native index structure for NOR-flash-based embedded devices

Authors:
Li-Pin Chang;Chen-Hui Hsu
Affiliations:
National Chiao-Tung University, Hsin-Chu, Taiwan, ROC;National Chiao-Tung University, Hsin-Chu, Taiwan, ROC
Venue:
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Year:
2009

Citing 10
Cited 0

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
A fast start-up technique for flash memory based computing systems

Proceedings of the 2005 ACM symposium on Applied computing
The Design of efficient initialization and crash recovery for log-based file systems over flash memory

ACM Transactions on Storage (TOS)
Efficient indexing data structures for flash-based sensor devices

ACM Transactions on Storage (TOS)
A transactional flash file system for microcontrollers

ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
A flash-memory based file system

TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
A log buffer-based flash translation layer using fully-associative sector translation

ACM Transactions on Embedded Computing Systems (TECS)
An efficient B-tree layer implementation for flash-memory storage systems

ACM Transactions on Embedded Computing Systems (TECS)
μ-tree: an ordered index structure for NAND flash memory

EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
A space-efficient flash translation layer for CompactFlash systems

IEEE Transactions on Consumer Electronics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices with NOR flash, are proposed. The challenge of data indexing over NOR flash is that data update and pointer update may recursively trigger each other. Our approach is to allow a bounded number of probes when a pointer is de-referenced. By this way update and garbage collection is largely simplified, because data can be moved around physical locations without invalidating any pointers. Even better, search with soft lists is very fast, because the probes provide opportunities of forward random skips. Soft lists are evaluated and compared against tree-based index, and soft lists are shown simple but efficient.