arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2103.15285cs.DC
收藏

大规模动态分布式系统检查点回卷恢复的协作部分快照算法及实验评估

A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations

Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama, Toshimitsu Masuzawa

摘要:

由大量计算实体组成的分布式系统容易出现故障,因为少数节点的故障会导致整个系统失败。因此,分布式系统的容错是一个关键问题。检查点回滚恢复是一种通用的、具有代表性的容错技术,它周期性地将整个系统状态(配置)记录到非易失性存储器中,当系统发生故障时,系统使用记录的配置进行自我恢复。为了记录分布式系统的配置,需要称为快照算法的特定算法。然而,许多快照算法需要系统中所有节点之间的协调;因此,频繁执行快照算法需要不可接受的通信成本,特别是如果系统很大。作为一种复杂的快照算法,已经引入了部分快照算法,该算法拍摄部分快照(而不是全局快照)。但是,如果两个或多个部分快照算法同时执行,并且它们的快照域重叠,则它们应该协调,以便(由算法拍摄的)部分快照是一致的。在本文中,我们提出了一种新的有效的部分快照算法的目的是减少通信的协调。在模拟中,我们表明,该算法大大优于现有的部分快照算法,在消息和时间复杂度。

英文摘要:

A distributed system consisting of a huge number of computational entities is prone to faults, because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint-rollback recovery is a universal and representative technique for fault tolerance; it periodically records the entire system state (configuration) to non-volatile storage, and the system restores itself using the recorded configuration when the system fails. To record a configuration of a distributed system, a specific algorithm known as a snapshot algorithm is required. However, many snapshot algorithms require coordination among all nodes in the system; thus, frequent executions of snapshot algorithms require unacceptable communication cost, especially if the systems are large. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a partial snapshot (instead of a global snapshot). However, if two or more partial snapshot algorithms are concurrently executed, and their snapshot domains overlap, they should coordinate, so that the partial snapshots (taken by the algorithms) are consistent. In this paper, we propose a new efficient partial snapshot algorithm with the aim of reducing communication for the coordination. In a simulation, we show that the proposed algorithm drastically outperforms the existing partial snapshot algorithm, in terms of message and time complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑