Learn More
A membership service for a synchronous distributed computer system is described. The system is assumed to be composed of groups in which a relatively frequent message exchange occurs. A hierarchy of connected groups constitutes a connected network. The membership service protocol reeects this hierarchical structure. The protocol tolerates timing, omission(More)
  • D Alstein, J H Hoepman, +5 authors Pascale I A Van Der Put
  • 1995
This paper investigates the complexity of self-stabilizing mutual exclusion protocols for distributed systems, where processors communicate through shared memory according to a strongly connected directed communication graph. Tchuente's approach of covering a network with one directed cycle is taken as point of departure. This protocol requires O(n 2n)(More)
  • 1