Proving the Herman-Protocol Conjecture
- Submitting institution
-
The University of Kent
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9522
- Type
- E - Conference contribution
- DOI
-
-
- Title of conference / published proceedings
- 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
- First page
- 104:1
- Volume
- 55
- Issue
- -
- ISSN
- 1868-8969
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2016
- URL
-
https://kar.kent.ac.uk/55083/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Herman’s algorithm is the textbook example of a randomized self-stabilization algorithm for a distributed system with ring topology. The runtime of this algorithm was conjectured in 2005 to be hN^2 with h=4/27, where N is the number of processes. This paper is significant because we prove that h is exactly 4/27, as conjectured, thereby closing this long-standing problem.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
