summaryrefslogtreecommitdiffstats
path: root/Documentation/device-mapper
diff options
context:
space:
mode:
authorKhazhismel Kumykov <khazhy@google.com>2018-01-19 15:07:37 -0800
committerMike Snitzer <snitzer@redhat.com>2018-01-29 13:44:58 -0500
commitf20426056f2eba3f0379779f0a75722e41bc28da (patch)
tree03684152f0cc079ad9d21804e2543e47059bb4ab /Documentation/device-mapper
parentcc65661981ae2424e27c695ae8d15604448eb666 (diff)
downloadop-kernel-dev-f20426056f2eba3f0379779f0a75722e41bc28da.zip
op-kernel-dev-f20426056f2eba3f0379779f0a75722e41bc28da.tar.gz
dm mpath selector: more evenly distribute ties
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> Reviewed-by: Martin Wilck <mwilck@suse.com> Signed-off-by: Mike Snitzer <snitzer@redhat.com>
Diffstat (limited to 'Documentation/device-mapper')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud