{"title":"当地的稳定剂","authors":"Y. Afek, S. Dolev","doi":"10.1109/ISTCS.1997.595159","DOIUrl":null,"url":null,"abstract":"A local stabilizer protocol that takes any on-line or of-line distributed algorithm and converts it into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is presented. Whenever the self-stabilizing version enters an inconsistent state, the inconsistency is detected, in O(1) time, and the system state is repaired in a local manner. The expected computation time that is lost during the repair process is proportional to the largest diameter of a faulty region.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"110","resultStr":"{\"title\":\"Local stabilizer\",\"authors\":\"Y. Afek, S. Dolev\",\"doi\":\"10.1109/ISTCS.1997.595159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A local stabilizer protocol that takes any on-line or of-line distributed algorithm and converts it into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is presented. Whenever the self-stabilizing version enters an inconsistent state, the inconsistency is detected, in O(1) time, and the system state is repaired in a local manner. The expected computation time that is lost during the repair process is proportional to the largest diameter of a faulty region.\",\"PeriodicalId\":367160,\"journal\":{\"name\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"110\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTCS.1997.595159\",\"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 Fifth Israeli Symposium on Theory of Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1997.595159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A local stabilizer protocol that takes any on-line or of-line distributed algorithm and converts it into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is presented. Whenever the self-stabilizing version enters an inconsistent state, the inconsistency is detected, in O(1) time, and the system state is repaired in a local manner. The expected computation time that is lost during the repair process is proportional to the largest diameter of a faulty region.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
