O1FS: Flash file system with O(1) crash recovery time
- Authors
- Park, Hyunchan; Noh, Sam H.; Yoo, Chuck
- Issue Date
- 11월-2014
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- O1FS; Crash recovery technique; NAND flash file system
- Citation
- JOURNAL OF SYSTEMS AND SOFTWARE, v.97, pp.86 - 96
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF SYSTEMS AND SOFTWARE
- Volume
- 97
- Start Page
- 86
- End Page
- 96
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/97006
- DOI
- 10.1016/j.jss.2014.07.008
- ISSN
- 0164-1212
- Abstract
- The crash recovery time of NAND flash file systems increases with flash memory capacity. Crash recovery usually takes several minutes for a gigabyte of flash memory and becomes a serious problem for mobile devices. To address this problem, we propose a new flash file system, O1FS. A key concept of our system is that a small number of blocks are modified exclusively until we change the blocks explicitly. To recover from crashes, O1FS only accesses the most recently modified blocks rather than the entire flash memory. Therefore, the crash recovery time is bounded by the size of the blocks. We develop mathematical models of crash recovery techniques and prove that the time complexity of O1FS is O(1), whereas that of other methods is proportional to the number of blocks in the flash memory. Our evaluation shows that the crash recovery of O1FS is about 18.5 times faster than that of a state-of-the-art method. (C) 2014 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.