Block-Based Allocation Algorithms for FLASH Memory in Embedded Systems

  • Pangfeng Liu
  • Chung-Hao Chuang
  • Jan-Jan Wu
Conference paper

DOI: 10.1007/978-3-540-73940-1_57

Volume 4671 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Liu P., Chuang CH., Wu JJ. (2007) Block-Based Allocation Algorithms for FLASH Memory in Embedded Systems. In: Malyshkin V. (eds) Parallel Computing Technologies. PaCT 2007. Lecture Notes in Computer Science, vol 4671. Springer, Berlin, Heidelberg

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 Re-arrival First Serve (FRFS) method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Pangfeng Liu
    • 1
  • Chung-Hao Chuang
    • 1
  • Jan-Jan Wu
    • 2
  1. 1.Department of Computer Science and Information Engineering, National Taiwan University, TaipeiTaiwan
  2. 2.Institute of Information Science, Academia Sinica, TaipeiTaiwan