论文信息 - Study on Garbage Collection Schemes for Flash-Based Linux Swap System

Study on Garbage Collection Schemes for Flash-Based Linux Swap System

NAND flash memory based SSDs (solid state disks) have become an alternative storage device for future computer systems. Legacy operating system functionalities like file system and virtual memory system should be carefully re-designed since flash memory cannot be overwritten unless erased in advance. In this paper, we study the performance of garbage collection schemes when flash memory is used as the Linux swap storage. We have collected swap I/O traces from Linux kernel and performed trace-driven simulation. We found that Linux swap system must be re-designed in order to use flash memory as swap storage.

[1] Hiroshi Motoda,et al. A Flash-Memory Based File System , 1995, USENIX.

[2] Hyokyung Bahn,et al. Page Replacement Algorithms for NAND Flash Memory Storages , 2007, ICCSA.

[3] Michael Wu,et al. eNVy: a non-volatile, main memory storage system , 1994, ASPLOS VI.

[4] Kern Koh,et al. An Efficient Garbage Collection Policy for Flash Memory Based Swap Systems , 2007, ICCSA.

[5] David Woodhouse,et al. JFFS : The Journalling Flash File System , 2001 .

[6] Ruei-Chuan Chang,et al. Cleaning policies in mobile computers using flash memory , 1999, J. Syst. Softw..

[7] Chanik Park,et al. Energy-aware demand paging on NAND flash-based embedded storages , 2004, Proceedings of the 2004 International Symposium on Low Power Electronics and Design (IEEE Cat. No.04TH8758).

[8] Longzhe Han,et al. CATA: A Garbage Collection Scheme for Flash Memory File Systems , 2006, UIC.

[9] Yeonseung Ryu,et al. An Intelligent Garbage Collection Algorithm for Flash Memory Storages , 2006, ICCSA.

[10] Marco Cesati,et al. Understanding the Linux Kernel, Third Edition , 2005 .

[11] Seon-Yeong Park,et al. FASS : A Flash-Aware Swap System , 2005 .