Block-Based Allocation Algorithms for FLASH Memory in Embedded Systems
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.
Unable to display preview. Download preview PDF.
- 1.Byu trace distribution center, http://tds.cs.byu.edu/tds/index.jsp
- 2.Chang, L.-P., Kuo, T.-W.: An adaptive stripping architecture for flash memory storage systems of embedded systems. In: IEEE Eighth Real-Time and Embedded Technology and Applications Symposium, pp. 601–606 (2002)Google Scholar
- 4.Chiang, M.-L., Lee, C.-H., Chang, R.-C.: Manage flash memory in personal communicate devices. In: Proceedings of IEEE International Symposium on Consumer Electronics, pp. 177–182 (1997)Google Scholar
- 5.Chou, L.-F., Liu, P.: Efficient allocation algorithms for flash file systems. In: 11th International Conference on Parallel and Distributed Systems, pp. 634–641 (2005)Google Scholar
- 6.Kawaguchi, A., Nishioka, S., Motoda, H.: A flash memory based file system. In: Proceedings of the USENIX Technical Conference, pp. 155–164 (1995)Google Scholar
- 7.Kim, H.-J., Lee, S.-G.: Memory management for flash storage system. In: Proceedings of the Computer Software and Applications Conference, pp. 284–293 (1999)Google Scholar
- 8.Malik, V.: Jffs2 is broken. In: Mailing List of Memory Technology Device (MTD) Subsystem for Linux (June 28, 2001)Google Scholar