{"title":"有界多项式随机一致","authors":"H. Attiya, D. Dolev, N. Shavit","doi":"10.1145/72981.73001","DOIUrl":null,"url":null,"abstract":"Abstract : In (A88), Abrahamson presented a solution to the randomized consensus problem of Chor, Israeli and Li (CIL87), without assuming the existence of anatomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. In (AH89), Aspens and Herlihy provide a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem, that is bounded in space and runs in polynomial expected time.","PeriodicalId":167067,"journal":{"name":"Proceedings of the eighth annual ACM Symposium on Principles of distributed computing","volume":"561 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"54","resultStr":"{\"title\":\"Bounded polynomial randomized consensus\",\"authors\":\"H. Attiya, D. Dolev, N. Shavit\",\"doi\":\"10.1145/72981.73001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract : In (A88), Abrahamson presented a solution to the randomized consensus problem of Chor, Israeli and Li (CIL87), without assuming the existence of anatomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. In (AH89), Aspens and Herlihy provide a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem, that is bounded in space and runs in polynomial expected time.\",\"PeriodicalId\":167067,\"journal\":{\"name\":\"Proceedings of the eighth annual ACM Symposium on Principles of distributed computing\",\"volume\":\"561 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"54\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the eighth annual ACM Symposium on Principles of distributed computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/72981.73001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the eighth annual ACM Symposium on Principles of distributed computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/72981.73001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract : In (A88), Abrahamson presented a solution to the randomized consensus problem of Chor, Israeli and Li (CIL87), without assuming the existence of anatomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. In (AH89), Aspens and Herlihy provide a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem, that is bounded in space and runs in polynomial expected time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
