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...
Saved in:
Published in | Journal of parallel and distributed computing Vol. 130; pp. 80 - 90 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.08.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!