一种实现消息高效早停统一共识协议的方法

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI:10.1109/ISPAN.2004.1300496

Xianbing Wang, Jiannong Cao, Y. M. Teo

{"title":"一种实现消息高效早停统一共识协议的方法","authors":"Xianbing Wang, Jiannong Cao, Y. M. Teo","doi":"10.1109/ISPAN.2004.1300496","DOIUrl":null,"url":null,"abstract":"Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t+1 processes engaging in sending messages in each round.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An approach to achieve message efficient early-stopping uniform consensus protocols\",\"authors\":\"Xianbing Wang, Jiannong Cao, Y. M. Teo\",\"doi\":\"10.1109/ISPAN.2004.1300496\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t+1 processes engaging in sending messages in each round.\",\"PeriodicalId\":198404,\"journal\":{\"name\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2004.1300496\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

同步分布式系统的现有共识协议集中于达成共识所需轮数的下界。本文提出了一种方法来显著降低一些统一共识协议的消息复杂性，同时达到相同的下界，其中对于任何t-弹性共识协议，每轮只有t+1个进程参与发送消息。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An approach to achieve message efficient early-stopping uniform consensus protocols

Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t+1 processes engaging in sending messages in each round.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.

自引率

0.00%

发文量