A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Self-stabilizing symmetry breaking in constant-space (extended abstract)
1992
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
We i n v estigate the problem of self-stabilizing round-robin token management s c heme on an anonymous bidirectional ring of identical processors, where each processor is an asynchronous probabilistic coin-ipping nite state machine which sends and receives messages. We show that the solution to this problem is equivalent to symmetry breaking i.e., leader election. Requiring only constant-size messages and message-passing model has practical implications: our solution can be implemented in
doi:10.1145/129712.129777
dblp:conf/stoc/MayerOOY92
fatcat:2prmlah2fjaq3j6xh4h4n73uoi