arrow
返回

Consistent Low Latency Scheduler for Distributed Key-Value Stores

delete2023-12-01
delete0
PRE
AI
W
Wanchun Jiang
H
Haoyang Li
Y
Yulong Yan
J
Ji Fa
黄
黄家玮 (Jiawei Huang)
王
王健鑫 (Jianxin Wang)
张
张彤 (Tong Zhang) *
DOI:10.1109/TPDS.2023.3315777delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Nowadays, the distributed key-value stores have be -come the basic building block for large-scale cloud applications. In large-scale distributed key-value stores, many key-value access operations, which will be processed in parallel on different servers, are usually generated for a single end-user request. Accordingly, the completion time of an end-user request is determined by the last completed key-value access operation. Scheduling the order of serving key-value access operations can effectively reduce the completion times of end requests, thereby improving the user ex-perience. However, existing scheduling algorithms hardly achieve consistent low latency due to the following challenges: the large overhead of cooperating clients and servers, the time-varying load and performance of servers, the traffic distribution can be either heavy-tailed or light-tailed and both the mean and the tail com-pletion time are expected to be low. In this paper, we formal-ize the problem of scheduling key-value access operations and show it is NP-hard. Furthermore, we heuristically design the dis-tributed adaptive scheduler (DAS), which distributively combines the largest remaining processing time last and the shortest remain-ing process time first algorithms. Theoretical analysis shows that DAS is adaptive to the time-varying traffic and server performance and can achieve consistent low mean and tail latency regardless of traffic distributions. Extensive simulations show that DAS reduces the mean request completion time by 17 similar to 50% with heavy-tailed traffic and 2 similar to 26% with light-tailed traffic, while keeping the smallest tail completion time, compared to the default first come first served algorithm. Moreover, DAS outperforms the existing Rein-SBF algorithm under various scenarios.
Keyword:
Servers
Tail
Lightly-tailed distribution
Heavily-tailed distribution
Scheduling algorithms
Low latency communication
Job shop scheduling
Adaptive
distributed key-value stores
request completion time
scheduling

期刊

IEEE Transactions on Parallel and Distributed Systems 封面图
IEEE Transactions on Parallel and Distributed Systems
IF:
6
论文数:
5.2K
被引数:
1.1W

机构

C
Central South University
学者数:
10.0W
论文数: 7.2W
被引数: 10.9W
引用论文

引用论文

Randomised, controlled trial of concomitant pneumococcal and meningococcal conjugate vaccines
err2010-11-01
err0
PREAI
errJ. Wysocki; S. Tansey; E. Brachet; S. Baker; W. Gruber; P. Giardina; A. Arora
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
AMS: Adaptive Multiget Scheduling Algorithm for Distributed Key-Value Stores
err2023-07-01
err2
PREAI
errJiang, Wanchun; Qiu, Yujia; Ji, Fa; Zhang, Yongjia; Zhou, Xiangqian; Wang, Jianxin
err分享
err收藏
Agent-based decision-making process in airport ground handling management
err2011-03-26
err0
PREAI
errPablo García Ansola; Andrés García Higuera; José Manuel Pastor; F. Javier Otamendi
err分享
err收藏
err分享
err收藏
The Tail at Scale在规模的尾巴
err2013-02-01
err1.2K
PREAI
errDean, Jeffrey; Barroso, Luiz Andre
err分享
err收藏
学者 查看更多内容