Reliable computation with cellular automata
Journal of Computer and System Sciences
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Memory efficient, self-stabilizing algorithm to construct BFS spanning trees
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Fast and lean self-stabilizing asynchronous protocols
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We consider asynchronous dynamic networks of identical finite (independent of the network size) automata. A useful data structure on such networks is a partial orientation of its edges. It needs to be straight, i.e. have null holonomy (the difference between the number of up and down edges in each cycle). It also needs to be centered, i.e., have a unique node with no down edges. Using such orientation, any feasible computational task can be efficiently implemented with self-stabilization and synchronization. There are (interdependent) self-stabilizing asynchronous finite automata protocols that straighten and centralize any orientation. Such protocols may vary in assorted efficiency parameters and it is desirable to have each replaceable with any alternative responsible for a simple limited task. We describe an efficient reduction of any computational task to any set of such protocols compliant with our interface conditions.