Latency analysis for distributed storage
Latency analysis for distributed storage
复制标题
分布式存储的延迟分析
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
J. Chamberland
中科院分区：
文献类型：
--
作者：
Parimal Parag;Archana Bura;J. Chamberland
现代通信和计算系统由不可靠节点组成的大型网络组成。然而，众所周知，这样的系统可以通过信息冗余、复制路径或复制计算来提供聚合可靠性。虽然冗余可能会增加系统的负载，但它也可以通过明智地管理额外的系统资源来提高性能。这种抽象范式的两个重要例子是从内容分发网络中的多个缓存访问内容和计算集群上的主/从计算。该领域最近的许多文章提出了冗余系统延迟性能的界限，描述了特定负载配置文件下的延迟-冗余权衡。遵循类似的研究路线，本文介绍了一系列系统负载和两种流行冗余方案的延迟-冗余权衡的新分析界限和近似技术。所提出的框架允许近似的平衡延迟分布，从其中可以得到各种指标，包括均值，方差和尾部衰减的平稳分布。
Modern communication and computation systems consist of large networks of unreliable nodes. Yet, it is well known that such systems can provide aggregate reliability via information redundancy, duplicating paths, or replicating computations. While redundancy may increase the load on a system, it can also lead to major performance improvements through the judicious management of additional system resources. Two important examples of this abstract paradigm are content access from multiple caches in content delivery networks and master/slave computations on compute clusters. Many recent articles in the area have proposed bounds on the latency performance of redundant systems, characterizing the latency-redundancy tradeoff under specific load profiles. Following a similar line of research, this article introduces new analytical bounds and approximation techniques for the latency-redundancy tradeoff for a range of system loads and two popular redundancy schemes. The proposed framework allows for approximating the equilibrium latency distribution, from which various metrics can be derived including mean, variance, and the tail decay of stationary distributions.