Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2010.17D.6.395

PRMS: Page Reallocation Method for SSDs  

Lee, Dong-Hyun (연세대학교 컴퓨터과학과)
Roh, Hong-Chan (연세대학교 컴퓨터과학과)
Park, Sang-Hyun (연세대학교 컴퓨터과학과)
Publication Information
The KIPS Transactions:PartD / v.17D, no.6, 2010 , pp. 395-404 More about this Journal
Abstract
Solid-State Disks (SSDs) have been currently considered as a promising candidate to replace hard disks, due to their significantly short access time, low power consumption, and shock resistance. SSDs, however, have drawbacks such that their write throughput and life span are decreased by random-writes, nearly regardless of SSDs controller designs. Previous studies have mostly focused on better designs of SSDs controller and reducing the number of write operations to SSDs. We suggest another method that reallocates data pages that tend to be simultaneously written to contiguous blocks. Our method gathers write operations during a period of time and generates write traces. After transforming each trace to a set of transactions, our method mines frequent itemsets from the transactions and reallocates the pages of the frequent itemsets. In addition, we introduce an algorithm that reallocates the pages of the frequent itemsets with moderate time complexity. Experiments using TPC-C workload demonstrated that our method successfully reduce 6% of total logical block access.
Keywords
SSDs; Flash Memory; Frequent Itemset Mining;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Pei, J., Han, J., and Mao, R., “CLOSET: An efficient algorithm for mining frequent closed itemsets”, In Proc. ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD’00), Dallas, TX, pp.11-20, 2000.
2 D. Burdick, M. Calimlim, and J. Gehrke, “MAFIA: a maximal frequent itemset algorithm for transactional databases”, In Intl. Conf. on Data Engineering, April 2001.
3 C. LaRosa and et al. “Frequent pattern mining for kernel trace data”, In Proc. of ACM SAC’08, 2008.
4 Charles Wright, Richard Spillane, Gopalan Sivathanu, and Erez Zadok, “Amino: Extending ACID Semantics to the File System.” In FAST ’05 Conference on File and Storage Technologies, December 2005.
5 Clifton. C, and Gengo. G., “Developing custom intrusion detection filters using data mining”, In Proceedings of the 2000 Military Communications International Symposium, 2000.
6 Lane, T. and Brodley, C. E. “Sequence matching and learning in anomaly detection for computer security”, In AAAI Workshop: AI approaches to Fraud Detection and Risk Management, pp.43-49, 1997.
7 Griffioen, J. and Appleton, R. “Reducing file system latency using a predictive approach”, In Proceedings of the USENIX Summer 1994 TechnicFal Conference, pp.197-207, 1994.
8 Li, Z., Chen, Z., and Zhou, Y. “Mining Block Correlations to Improve Storage Performance”, ACM Transactions on Storage 1, 2, pp. 213-245, 2005.   DOI
9 www.hammerora.sourceforge.net/
10 www.tpc.org/tpcc/
11 www.intel.com/design/flash/nand/extreme/index.htm
12 정승국, 고대식, “차세대 스토리지 SSD 기술 동향”, 정보통신연구진흥원 report, 2008.
13 장성원, “차세대 저장장치 SSD의 부상과 시사점”, SERI report, pp.1-15, 2008.
14 S. W. Lee, et al., “A log buffer-based flash translation layer using fully-associative sector translation”, ACM Transactions on Embedded Computing Systems (TECS), 6(3), pp. 18-es, July 2007.   DOI
15 Kim, J., Kim, J. M., Noh, S. H., Min, S. L., and Cho, Y, “A space-efficient flash translation layer for compact-flash systems”, IEEE Transactions on Consumer Electronics, 48(2), 2002.   DOI
16 나갑주, 이상원 “플래쉬 메모리 기반의 B+트리 알고리즘”, 한국인터넷정보학회 춘계학술발표대회 논문집, 제 7권, 제 1호, pp.167-172, 2006.
17 김성탄, 김상우, 이상원, “Flash SSD 상에서 인덱스 기반 질의 처리”, 한국컴퓨터종합학술대회 논문집, 제 1권, 제 35호, pp. 33-34, 2008.
18 L. Chang. “On efficient wear leveling for large-scale flash-memory storage systems”, SAC’07, pp.1126-1130, 2007.
19 K. M. J. Lofgren, R. D. Norman, G B. Thelin, and A. Gupta, “Wear Leveling Techniques for Flash EEPROM”, In United States Patent, No 6,850,443, 2005.
20 Feng Chen, et al., “Understanding Intrinsic Characteristics and System Implications of Flash Memory based Solid State Drives”, ACM SIGMETRICS, 2009.
21 R. Agrawal, T. Imielinski, and A. Swami. “Mining association rules between sets of items in large databases”, Proceedings of the ACM SIGMOD Int'l Conferenceon Management of Data, 1993.
22 Agrawal R, Srikant R. “Fast Algorithms for Mining Association Rules”, VLDB, pp.487-99. 1994.
23 J. Han, H. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation”, In Proc. Conf. on the Management of Data (SIGMOD’00, Dallas, TX), ACM Press, New York, NY, USA 2000.
24 Nitin Agrawal, et al., “Design tradeoffs for SSDs performance”, USENIX 2008, p.57-70, 2008.