Evaluating the Effectiveness of Replication for Tail-Tolerance
Evaluating the Effectiveness of Replication for Tail-Tolerance
复制标题
评估尾部耐受性复制的有效性
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Juan F. Pérez
中科院分区：
文献类型：
--
作者：
Z. Qiu;Juan F. Pérez
计算集群（CC）是一种经济高效的高性能平台，用于计算密集型科学和工程应用。管理CC的一个关键挑战是始终实现较短的响应时间。特别地，尾部容忍方法旨在保持响应时间分布的尾部较短。在本文中，我们探讨了并发复制与取消，尾部容忍的方法，涉及到处理请求和他们的副本并发，检索结果从第一个副本完成，并取消所有其他副本。我们提出了一个随机模型，认为任何数量的副本，一般处理和到达时间间隔，并计算响应时间分布。我们发现，复制可以非常有效地保持响应时间的尾巴短，但这些好处高度依赖于处理时间的分布，以及CC的利用率和到达过程的统计特性。我们还利用该模型来支持选择的副本的最佳数量，和一个资源配置策略，满足服务水平的目标上的响应时间序列。
Computing clusters (CC) are a cost-effective high-performance platform for computation-intensive scientific and engineering applications. A key challenge in managing CCs is to consistently achieve low response times. In particular, tail-tolerant methods aim to keep the tail of the response-time distribution short. In this paper we explore concurrent replication with cancelling, a tail-tolerant approach that involves processing requests and their replicas concurrently, retrieving the result from the first replica that completes, and cancelling all other replicas. We propose a stochastic model that considers any number of replicas, general processing and inter-arrival times, and computes the response time distribution. We show that replication can be very effective in keeping the response-time tail short, but these benefits highly depend on the processing-time distribution, as well as on the CC utilization and the statistical characteristics of the arrival process. We also exploit the model to support the selection of the optimal number of replicas, and a resource provisioning strategy that meets service-level objectives on the response-time percentiles.