EF-greedy: A novel garbage collection policy for flash memory based embedded systems

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Flash memory is becoming increasingly important for embedded systems because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. Although flash memory has attractive features, it should perform garbage collection, which includes erase operations. The erase operations are very slow, and usually decrease the performance of the system. Besides, the number of the erase operations allowed to each block is also limited. To minimize the garbage collection time and evenly wear out, our proposed garbage collection policy focuses on minimizing the garbage collection time and wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing garbage collection policies in terms of the garbage collection time and the endurance of flash memory. Specifically, we have shown that the performance improvement of our proposed policy against the greedy policy in terms of the endurance of flash memory is as much as 90.6%. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kwon, O., Lee, J., & Koh, K. (2007). EF-greedy: A novel garbage collection policy for flash memory based embedded systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4490 LNCS, pp. 913–920). Springer Verlag. https://doi.org/10.1007/978-3-540-72590-9_138

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free