A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
IEEE Transactions on Computers
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Linear time self-stabilizing colorings
Information Processing Letters
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Transformations for write-all-with-collision model
Computer Communications
Alternators in read/write atomicity
Information Processing Letters
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A distributed algorithm for a b-coloring of a graph
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
Our purpose in this paper is to propose a new protocol that can ensure mutual exclusion between neighboring nodes in an arbitrary distributed system, i.e., under the given protocol no two neighboring nodes can execute their critical sections concurrently. This protocol can be used to run a serial model self stabilizing algorithm in a distributed environment that accepts as atomic operations only "send a message", "receive a message", and "update a state". Unlike the scheme in [1], our protocol does not use time-stamps (which are basically unbounded integers); our protocol is a generalization of the protocol described in [2] which was restricted to work only for tree structured distributed systems. Like the protocol in [2], our algorithm uses only bounded integers and can be easily implemented.