lkml.org 
[lkml]   [2020]   [Aug]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    From
    Subject[PATCH v2 0/5] Support Age-Threshold based Garbage Collection for f2fs
    Date
    This patch series introduce a new garbage collection algorithm named ATGC
    (Age Threshold based Garbage Collection) in order to enhance efficiency and
    effect of background garbage collection.

    ATGC algorithm tries to fliter few oldest candidates according to defined
    age threshold, it selects source section in those candidates and then
    select target segment which has almost the same age of source section,
    finally, it migrates valid blocks from source section into target segment
    with SSR allocator, enhancement shows in below aspects:
    - it avoids selecting young victim section which may have high update
    frequency;
    - SSR write avoids unneeded movement of blocks locate in target segment;
    - source section and target segment has almost the same age (update
    frequency), it keeps well hot/cold separation effect;

    Patch 1 introduces in-memory curseg, since it only exists in memory, so it
    avoids on-disk layout change whenever we want to add a new type of log.
    Firstly, adapting aligned pinfile allocation to use in-memory curseg,
    later, we will use in-memory curseg in ATGC feature for migration as well.

    Patch 2 changes segment's mtime definition from recording last update time
    to recording average update time, so that it can indicate more precise
    update time of each valid blocks in segment.

    Patch 3 changes segment mtime update policy during GC, 1) don't update
    original segment's mtime; 2) inherit segment's mtime from original segment
    to target segment.

    Patch 4 adds to support 64-bits key in rb-tree node entry, and introduce
    f2fs_lookup_rb_tree_ext() to support lookup functionality with 64-bits key.

    Patch 5 adds to support ATGC skeleton to enhance effect and efficiency
    of BGGC.

    Test and result:
    - create 160 dirty segments:
    * half of them have 128 valid blocks per segment
    * left of them have 384 valid blocks per segment
    - run background GC

    Benefit: GC count and block movement count both decrease obviously:

    - Before:
    GC calls: 162 (BG: 220)

    Try to move 41454 blocks (BG: 41454)
    - data blocks : 40960 (40960)

    SSR: 0 blocks in 0 segments
    LFS: 41364 blocks in 81 segments

    - After:
    GC calls: 75 (BG: 76)

    Try to move 12813 blocks (BG: 12813)
    - data blocks : 12544 (12544)

    SSR: 12032 blocks in 77 segments
    LFS: 855 blocks in 2 segments

    v1 -> v2:
    - patch 1/5: fix wrong log type
    - patch 3/5: add missing blank line in between functions
    - patch 5/5: add mount option to enable atgc

    Chao Yu (5):
    f2fs: introduce inmem curseg
    f2fs: record average update time of segment
    f2fs: inherit mtime of original block during GC
    f2fs: support 64-bits key in f2fs rb-tree node entry
    f2fs: support age threshold based garbage collection

    Documentation/filesystems/f2fs.rst | 2 +
    fs/f2fs/checkpoint.c | 7 +-
    fs/f2fs/data.c | 2 +-
    fs/f2fs/debug.c | 10 +-
    fs/f2fs/extent_cache.c | 37 ++-
    fs/f2fs/f2fs.h | 51 +++-
    fs/f2fs/file.c | 5 +-
    fs/f2fs/gc.c | 372 ++++++++++++++++++++++++++++-
    fs/f2fs/gc.h | 25 ++
    fs/f2fs/segment.c | 332 +++++++++++++++++++------
    fs/f2fs/segment.h | 40 +++-
    fs/f2fs/super.c | 35 ++-
    include/trace/events/f2fs.h | 8 +-
    13 files changed, 818 insertions(+), 108 deletions(-)

    --
    2.26.2

    \
     
     \ /
      Last update: 2020-08-04 15:16    [W:4.285 / U:0.084 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site