SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM

DOI10.1080/10637199808947375zbMath1051.68877OpenAlexW2119318510MaRDI QIDQ3146520

Pradip K. Srimani, Gheorghe Antonoiu

Publication date: 12 September 2002

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199808947375

zbMATH Keywords

self-stabilizing distributed algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives

Cites Work

• Unnamed Item
• Self-stabilization (in spite of distributed control) in tree-structured systems
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing depth-first search
• Self-stabilizing systems in spite of distributed control
• A new solution of Dijkstra's concurrent programming problem
• The mutual exclusion problem

This page was built for publication: SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM