An effective data clustering method based on expected update time in flash memory environment
- Authors
- Bae, Duck-Ho; Park, Se-Mi; Kim, Sang-Wook; Chang, Ji-Woong; Jeong, Byeong-Soo; Cho, Seong-je
- Issue Date
- Mar-2014
- Publisher
- Association for Computing Machinery
- Keywords
- Expected update time; Flash memory; Hot data clustering
- Citation
- Proceedings of the ACM Symposium on Applied Computing, pp.1492 - 1497
- Indexed
- SCOPUS
- Journal Title
- Proceedings of the ACM Symposium on Applied Computing
- Start Page
- 1492
- End Page
- 1497
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/160466
- DOI
- 10.1145/2554850.2554900
- ISSN
- 0000-0000
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/160466)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.