Block-Based Allocation Algorithms for FLASH Memory in Embedded Systems.
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
4671 LNCS
Pages
569-578
Date Issued
2007
Author(s)
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. © Springer-Verlag Berlin Heidelberg 2007.
Other Subjects
Algorithms; Embedded systems; Intelligent agents; Problem solving; First Rearrival First Serve (FRFS); Offline allocation algorithm; Online algorithms; Resource allocation
Type
conference paper