Bryan E. Olivier

Learn More
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