F2FS is a flash file system initially developed by Samsung Electronics for the Linux kernel.
| FactSnippet No. 1,594,221 |
12 Facts About F2FS
1.
2.
Motive for F2FS was to build a file system that, from the start, takes into account the characteristics of NAND flash memory-based storage devices, which are widely used in computer systems ranging from mobile devices to servers.
| FactSnippet No. 1,594,222 |
3.
F2FS was designed on a basis of a log-structured file system approach, which is adapted to newer forms of storage.
| FactSnippet No. 1,594,223 |
4.
Jaegeuk Kim, the principal F2FS author, has stated that it remedies some known issues of the older log-structured file systems, such as the snowball effect of wandering trees and high cleaning overhead.
| FactSnippet No. 1,594,224 |
5.
F2FS uses the checkpoint scheme to maintain file system integrity.
| FactSnippet No. 1,594,225 |
6.
At mount time, F2FS first tries to find the last valid checkpoint data by scanning the CP area.
| FactSnippet No. 1,594,226 |
7.
Similar to traditional file structures, F2FS has three types of nodes: inode, direct node, indirect node.
| FactSnippet No. 1,594,227 |
8.
When F2FS finds a file name in a directory, first a hash value of the file name is calculated.
| FactSnippet No. 1,594,228 |
9.
F2FS adopts a hybrid scheme where the copy-and-compaction scheme is adopted by default, but the policy is dynamically changed to the threaded log scheme according to the file system status.
| FactSnippet No. 1,594,229 |
10.
F2FS expects the section size to be the same as the garbage collection unit size in FTL.
| FactSnippet No. 1,594,230 |
11.
F2FS does cleaning both on demand, and in the background.
| FactSnippet No. 1,594,231 |
12.
F2FS uses the greedy algorithm for on-demand cleaning, the background cleaner uses the cost-benefit algorithm.
| FactSnippet No. 1,594,232 |