Duck-Ho Bae
ABSTRACT
Flash memory has its unique characteristics: The write operation is much more costly than the read operation, and in-place updating is not allowed. In flash memory environment, in order to reduce the cost of copying valid pages during an erase operation, hot data clustering methods have been proposed. They try to store data with high write frequency together into the same block. In this paper, we first analyze the fundamental problem of existing hot data clustering methods. Based on this analysis, we propose an effective method for data clustering in flash memory environment. The proposed method tries to store data having similar expected update times together in the same block, thereby reducing the cost of copying valid pages significantly. For performance evaluation, we conduct extensive experiments. The results show that our method achieves speed-up by up to 1.7 times compared with existing one.
- D. Bae, J. Chang, and S. Kim, "Clustering and Non-clustering Effects in Flash Memory Databases," In Proc. IEEE DEXA Int'l Workshop on Database and Expert Systems Application, pp. 4--8, 2009. Google Scholar
Digital Library
- S. On, H. Hu, Y. Li, and J. Xu, "Flash-Optimized B+-Tree," Journal of Computer Science and Technology, Vol. 25, No. 3, pp. 509--522, 2010. Google ScholarDigital Library
- D. Bae, J. Chang, and S. Kim, "An Efficient Method for Record Management in Flash Memory Environment," Journal of Systems Architecture, Vol. 58, No. 6--7, pp. 221--232, 2012. Google ScholarDigital Library
- K. Yim, "A Novel Memory Hierarchy for Flash Memory Based Storage Systems," Journal of Semiconductor Technology and Science, Vol. 5, No. 4, pp. 262--269, 2005.Google Scholar
- C. Wu, L. Chang, and T. Kuo, "An Efficient B-Tree Layer for Flash-Memory Storage Systems," In Proc. Int'l. Conf. on Real-Time and Embedded Computing Systems and Applications, RTCSA, pp. 409--430, 2003.Google Scholar
- L. Cha, T. Kuo, and S. Lo, "Real-time Garbage Collection for Flash-Memory Storage Systems of Real-time Embedded Systems," ACM Transactions on Embedded Computing Systems, TECS, Vol. 3, No. 4, pp. 837--863, 2004. Google ScholarDigital Library
- L. Chang and T. Kuo, "An Adaptive Striping Architecture for Flash Memory Storage Systems of Embedded Systems," In Proc. of IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, pp. 187--196, 2002. Google ScholarDigital Library
- S. Lee and B. Moon, "Design of Flash-Based DBMS: An In-Page Logging Approach," In Proc. ACM Int'l. Conf. on Management of Data, SIGMOD, pp. 55--66, 2007. Google ScholarDigital Library
- M. Chiang, P. Lee, and R. Chang, "Using Data Clustering to Improve Cleaning Performance for Flash Memory," Software-Practice and Experience, Vol. 29, No. 3, pp. 267--290, 1999. Google ScholarDigital Library
- E. Gal and S. Toledo, "Algorithms and Data Structures for Flash Memories," ACM Computing Surveys, Vol. 37, No. 2, pp. 138--163, 2005. Google ScholarDigital Library
- M.l Rosenblum and J. Ousterhout, "The Design and Implementation of a Log-Structured File System," ACM Transactions on Computer Systems, TOCS, Vol. 10, No. 1, pp. 26--52, 1991. Google ScholarDigital Library
- M. Chiang, P. Lee, and R. Chang, "Managing Flash Memory in Personal Communication Devices," In Proc. IEEE Int'l Symp. on Consumer Electronics, ISCE, pp. 177--182, 1997.Google Scholar
- L. Chang, "On Efficient Wear Leveling for Large-Scale Flash-Memory Storage Systems," In Proc. of the ACM Symp. on Applied Computing, ACM SAC, pp. 1126--1130, 2007. Google ScholarDigital Library
- S. Park, J. Chang, D. Bae, and S. Kim, "Hot Data Clustering in Flash Memory Environment," In Proc. of Applications and Principles of Information Science, APIS, pp. 245--248, 2009.Google Scholar
- H. Dai, M. Neufeld, and R. Han, "ELF: An Efficient Log-Structured Flash File System For Micro Sensor Nodes," In Proc. Int'l. Conf. on Embedded Networked Sensor Systems, SENSYS, pp. 176--187, 2004. Google ScholarDigital Library
- A. Kawaguchi, S. Nishioka, and H. Motoda, "A Flash-Memory Based File System," In Proc. USENIX Technical Conf. on Unix and Advanced Computing Systems, pp. 155--164, 1995. Google ScholarDigital Library
- J. Hsieh, L. Chang, and T. Kuo, "Efficient On-line Identification of Hot Data for Flash-Memory Management," In Proc. of the ACM Symp. on Applied Computing, ACM SAC, pp. 838--842, Mar. 2005. Google ScholarDigital Library
- Samsung NAND Flash Memory, http://www.samsung.com/products/semiconductor/NANDFlash/Google Scholar
Index Terms
- An effective data clustering method based on expected update time in flash memory environment
Recommendations
NAND flash memory system based on the Harvard buffer architecture for multimedia applications
The main purpose of this research is to design a new memory architecture for NAND flash memory to provide XIP (execute in place) for code execution as well as overcome the biggest bottleneck for data execution. NOR flash for multimedia application is ...
Next high performance and low power flash memory package structure
In general, NAND flash memory has advantages in low power consumption, storage capacity, and fast erase/write performance in contrast to NOR flash. But, main drawback of the NAND flash memory is the slow access time for random read operations. Therefore,...
Performance Trade-Offs in Using NVRAM Write Buffer for Flash Memory-Based Storage Devices
While NAND flash memory is used in a variety of end-user devices, it has a few disadvantages, such as asymmetric speed of read and write operations, inability to in-place updates, among others. To overcome these problems, various flash-aware strategies ...
Comments