{"title":"基于简单环的选举算法的消息复杂度实证分析","authors":"F. Mattern","doi":"10.1109/ICDCS.1989.37935","DOIUrl":null,"url":null,"abstract":"Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the rather conservative mathematical estimations indicate.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Message complexity of simple ring-based election algorithms-an empirical analysis\",\"authors\":\"F. Mattern\",\"doi\":\"10.1109/ICDCS.1989.37935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the rather conservative mathematical estimations indicate.<<ETX>>\",\"PeriodicalId\":266544,\"journal\":{\"name\":\"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.1989.37935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1989.37935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Message complexity of simple ring-based election algorithms-an empirical analysis
Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the rather conservative mathematical estimations indicate.<>