Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract).
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract).
复制标题
逐轮故障检测器:统一同步和异步(扩展摘要)。
DOI:
--
复制
发表时间:
1998
期刊:
影响因子:
--
通讯作者:
E. Gafni
中科院分区:
文献类型:
--
作者:
E. Gafni
This paper presents a new family of models of distributed-computation which combines features from synchronous, asynchronous, and failure-detectoraugmented systems. Like synchronous systems, computation in this family of models evolves in rounds, and communication missed at a round is lost. Unlike synchronous systems, information that is missed at a round does not necessarily imply a real process failure. The features of a specific model is captured in an abstract module called the round-by-round fault detector. The abstraction of system features into such a module facilitates the comparison of different systems, by contrasting their associated fault detectors. We show that this family of models unifies the study of synchrony, asynchrony, message-passing and shared memory. We further show that this approach leads to the development of shorter and simpler proofs of important results such as a lower bound on the number of rounds to achieve k-set agreement in a synchronous system. We believe that studying distributed systems through the proposed unifying framework will lead to new results and insights. *Work supported by UCLA Academic Senate Grant. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial ahntage end thet copies bear this notice and the full citation on the f& page. To copy otherwise, to republish, to post on servers or to redistribute to lists. requires prior specific permission and/or a fee. PODC! 98 Puerto Valkuta Mexico Copyright ACM 1998 O-89791-977-7/98/ 6...$5.00