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.
| Original language | English |
|---|---|
| Pages (from-to) | 86-96 |
| Number of pages | 11 |
| Journal | Journal of Systems and Software |
| Volume | 97 |
| DOIs | |
| Publication status | Published - 2014 Jan 1 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Software
- Information Systems
Cite this
O1FS : Flash file system with O(1) crash recovery time. / Park, Hyunchan; Noh, Sam H.; Yoo, Hyuck.
In: Journal of Systems and Software, Vol. 97, 01.01.2014, p. 86-96.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - O1FS
T2 - Flash file system with O(1) crash recovery time
AU - Park, Hyunchan
AU - Noh, Sam H.
AU - Yoo, Hyuck
PY - 2014/1/1
Y1 - 2014/1/1
N2 - 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.
AB - 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.
KW - Crash recovery technique
KW - NAND flash file system
KW - O1FS
UR - http://www.scopus.com/inward/record.url?scp=84908205934&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84908205934&partnerID=8YFLogxK
U2 - 10.1016/j.jss.2014.07.008
DO - 10.1016/j.jss.2014.07.008
M3 - Article
VL - 97
SP - 86
EP - 96
JO - Journal of Systems and Software
JF - Journal of Systems and Software
SN - 0164-1212
ER -