lkml.org 
[lkml]   [2018]   [Jan]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    Patch in this message
    /
    From
    Subject[PATCH] dm mpath selector: more evenly distribute ties
    Date
    Move the last used path to the end of the list (least preferred) so that
    ties are more evenly distributed.

    For example, in case with three paths with one that is slower than
    others, the remaining two would be unevenly used if they tie. This is
    due to the rotation not being a truely fair distribution.

    Illustrated: paths a, b, c, 'c' has 1 outstanding IO, a and b are 'tied'
    Three possible rotations:
    (a, b, c) -> best path 'a'
    (b, c, a) -> best path 'b'
    (c, a, b) -> best path 'a'
    (a, b, c) -> best path 'a'
    (b, c, a) -> best path 'b'
    (c, a, b) -> best path 'a'
    ...

    So 'a' is used 2x more than 'b', although they should be used evenly.

    With this change, the most recently used path is always the least
    preferred, removing this bias resulting in even distribution.
    (a, b, c) -> best path 'a'
    (b, c, a) -> best path 'b'
    (c, a, b) -> best path 'a'
    (c, b, a) -> best path 'b'
    ...

    Signed-off-by: Khazhismel Kumykov <khazhy@google.com>
    ---
    drivers/md/dm-queue-length.c | 6 +++---
    drivers/md/dm-service-time.c | 6 +++---
    2 files changed, 6 insertions(+), 6 deletions(-)

    diff --git a/drivers/md/dm-queue-length.c b/drivers/md/dm-queue-length.c
    index 23f178641794..969c4f1a3633 100644
    --- a/drivers/md/dm-queue-length.c
    +++ b/drivers/md/dm-queue-length.c
    @@ -195,9 +195,6 @@ static struct dm_path *ql_select_path(struct path_selector *ps, size_t nr_bytes)
    if (list_empty(&s->valid_paths))
    goto out;

    - /* Change preferred (first in list) path to evenly balance. */
    - list_move_tail(s->valid_paths.next, &s->valid_paths);
    -
    list_for_each_entry(pi, &s->valid_paths, list) {
    if (!best ||
    (atomic_read(&pi->qlen) < atomic_read(&best->qlen)))
    @@ -210,6 +207,9 @@ static struct dm_path *ql_select_path(struct path_selector *ps, size_t nr_bytes)
    if (!best)
    goto out;

    + /* Move most recently used to least preferred to evenly balance. */
    + list_move_tail(&best->list, &s->valid_paths);
    +
    ret = best->path;
    out:
    spin_unlock_irqrestore(&s->lock, flags);
    diff --git a/drivers/md/dm-service-time.c b/drivers/md/dm-service-time.c
    index 7b8642045c55..f006a9005593 100644
    --- a/drivers/md/dm-service-time.c
    +++ b/drivers/md/dm-service-time.c
    @@ -282,9 +282,6 @@ static struct dm_path *st_select_path(struct path_selector *ps, size_t nr_bytes)
    if (list_empty(&s->valid_paths))
    goto out;

    - /* Change preferred (first in list) path to evenly balance. */
    - list_move_tail(s->valid_paths.next, &s->valid_paths);
    -
    list_for_each_entry(pi, &s->valid_paths, list)
    if (!best || (st_compare_load(pi, best, nr_bytes) < 0))
    best = pi;
    @@ -292,6 +289,9 @@ static struct dm_path *st_select_path(struct path_selector *ps, size_t nr_bytes)
    if (!best)
    goto out;

    + /* Move most recently used to least preferred to evenly balance. */
    + list_move_tail(&best->list, &s->valid_paths);
    +
    ret = best->path;
    out:
    spin_unlock_irqrestore(&s->lock, flags);
    --
    2.16.0.rc1.238.g530d649a79-goog
    [unhandled content-type:application/pkcs7-signature]
    \
     
     \ /
      Last update: 2018-01-20 00:08    [W:3.591 / U:1.172 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site