Haste makes waste: The On–Off algorithm for replica selection in key–value stores

In current large-scale distributed key–value stores, the tail latency of the key–value accesses generated by end-user requests is crucial to the response time of these requests. To cut the tail latency, the replica selection algorithm, which selects a replica server for each key by a client and thus...

Full description

Saved in:
Bibliographic Details
Published inJournal of parallel and distributed computing Vol. 130; pp. 80 - 90
Main Authors Jiang, Wanchun, Xie, Haiming, Zhou, Xiangqian, Fang, Liyuan, Wang, Jianxin
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.08.2019
Subjects
Online AccessGet full text

Cover

Loading…