• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Symposium on Reliable Distributed Systems >Héron: Taming Tail Latencies in Key-Value Stores Under Heterogeneous Workloads
【24h】

Héron: Taming Tail Latencies in Key-Value Stores Under Heterogeneous Workloads

机译：Héron：在异构工作负载下驯服键值存储中的尾部延迟

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Avoiding latency variability in distributed storage systems is challenging. Even in well-provisioned systems, factors such as the contention on shared resources or the unbalanced load between servers affect the latencies of requests and in particular the tail (95th and 99th percentile) of their distribution. One effective counter measure for reducing tail latency in key-value stores is to provide efficient replica selection algorithms. However, existing solutions are based on the assumption that all requests have almost the same execution time. This is not true for real workloads. This mismatch leads to increased latencies for requests with short execution time that get scheduled behind requests with large execution times. We propose Héron, a replica selection algorithm that supports workloads with heterogeneous request execution times. We evaluate Héron in a cluster of machines using a synthetic dataset inspired from the Facebook dataset as well as two real datasets from Flickr and WikiMedia. Our results show that Héron outperforms state-of-the-art algorithms by reducing both median and tail latency by up to 41%.
机译：避免分布式存储系统中的延迟变化具有挑战性。即使在配置良好的系统中，诸如共享资源争用或服务器之间的不平衡负载之类的因素也会影响请求的延迟，尤其是其分布的尾部（第95和第99个百分位数）。减少键值存储中尾部等待时间的一种有效对策是提供有效的副本选择算法。但是，现有解决方案基于所有请求都具有几乎相同的执行时间的假设。对于实际的工作负载，情况并非如此。这种不匹配会导致执行时间短的请求的延迟增加，而延迟时间要比执行时间长的请求晚。我们提出了Héron，这是一种复制选择算法，可支持具有异构请求执行时间的工作负载。我们使用来自Facebook数据集以及Flickr和WikiMedia的两个真实数据集的综合数据集，对一台机器集群中的Héron进行了评估。我们的结果表明，Héron可以将中值和尾部延迟降低多达41％，从而胜过了最新算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号