Lines Matching refs:as

5 NAND flash memory-based storage devices, such as SSD, eMMC, and SD cards, have
49 the upper index structures such as inode, inode map, and checkpoint block are
50 also updated recursively. This problem is called as wandering tree problem [1],
52 propagation as much as possible.
61 as a cleaning process.
63 The process consists of three operations as follows.
72 amount of valid data to be moved, and move them quickly as well.
82 - Align FS data structures to the operational units in FTL as best efforts
86 - Use a term, “node”, that represents inodes as well as various pointer blocks
124                        does not aware of cold files such as media files.
132 flush_merge	       Merge concurrent cache_flush commands as much as possible
142                        time as much as possible, even though normal performance
145                        as many as extent which map between contiguous logical
157 /sys/kernel/debug/f2fs/ contains information about all the partitions mounted as
262 4. Format the block device, and then mount as f2fs
268 The mkfs.f2fs is for the use of formatting a partition as the f2fs filesystem,
329 consists of multiple segments as described below.
360  : It contains segment information such as valid block count and bitmap for the
388 One of them always indicates the last valid data, which is called as shadow copy
392 valid, as shown as below.
414 indirect node pointer as described below. One direct node block contains 1018
445 - type		file type such as directory, symlink, etc
473 a hash table with dedicated number of hash buckets as shown below. Note that
516 1 to N in the same way as the lookup operation.
545 tion. The copy-and-compaction scheme which is known as cleaning, is well-suited
556 same as the unit size of garbage collection in FTL. Furthermore, with respect
558 logs from different zones as much as possible, since FTL can write the data in