Abstract
To improve the overall performance and service life of the flash memory, a new type of file management algorithm for flash memory has been designed. A new linear ordering function is added to the traditional file management system. Its function is to balance the used frequency of every part in the flash memory. The new file should be stored in the space whose writing times are smaller, thus improving the overall efficiency, extending the service life of flash memory. In the same operating conditions, only the former half or even less space has been used repeatedly in the traditional file management system, while in the new system, files are stored equally in all regions, the writing times of every part are balanced basically. The capability of the management system designed in this paper is better than the traditional one, especially in the case of being operated more times.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yue, L., Xiang, X., Jin, P.: An adaptive storage management method of flash memory. J. Small Miniature Computer System 8 (2010)
Su, X.: Simulation platform and applied research of flash memory storage device. China science and technology university, Anhui (2010)
Tang, W.: The research of large capacity NAND flash memory storage. The National Defense Science and Technology University, Hunan (2009)
Gal, E., Toledo, S.: Algorithms and Data Structures for Flash Memories. J. ACM Computing Surveys, 138–163 (2005)
Ajwani, D., Malinger, I., Meyer, U.: Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 208–219. Springer, Heidelberg (2008)
Chang, L.P.: Hybrid Solid-State Disks Combining Heterogeneous NAND Flash in Large SSDs, pp. 428–433. IEEE Computer Society Press, Los Alamitos (2008)
Chang, Y., Hsieh, J., Kuo, T.: Endurance enhancement of flash. In: Proceedings of the 44m Annual Conference on Design Automation, pp. 212–217. ACM Press, New York (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, L., Cheng, C., Wang, J. (2011). Design of Equal Probability Store Algorithm for Flash Memory. In: Tan, H., Zhou, M. (eds) Advances in Information Technology and Education. Communications in Computer and Information Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22418-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-22418-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22417-1
Online ISBN: 978-3-642-22418-8
eBook Packages: Computer ScienceComputer Science (R0)