Block-based allocation algorithms for FLASH memory in embedded systems

Authors:
Pangfeng Liu;Chung-Hao Chuang;Jan-Jan Wu
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan
Venue:
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Year:
2007

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
A New Flash Memory Management for Flash Storage System

COMPSAC '99 23rd International Computer Software and Applications Conference
An Adaptive Striping Architecture for Flash Memory Storage Systems of Embedded Systems

RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Real-time garbage collection for flash-memory storage systems of real-time embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
Efficient Allocation Algorithms for FLASH File Systems

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
A flash-memory based file system

TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings

Probability Based Page Data Allocation Scheme in Flash Memory

PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A flash memory has write-once and bulk-erase properties so that an intelligent allocation algorithm is essential to providing applications efficient storage service. This paper first demonstrates that the online version of FLASH allocation problem is difficult, since we can find an adversary that makes every online algorithm to use as many number of blocks as a naive and inefficient algorithm. As a result we propose an offline allocation algorithm called Best Match (BestM) for allocating blocks in FLASH file systems. The experimental results indicate that BestM delivers better performance than a previously proposed First Rearrival First Serve (FRFS) method.