Scheduling of Dynamic Participants in Real-Time Distributed Systems

Access to shared resources can be controlled by schedules or mutual exclusion. Such methods are not practical in an environment with dynamic participants, where nodes requiring access to shared resources can enter or leave the scene at any time. Current scheduling methods are usually centralized, demand that the system has a clear idea of when the resources are required and do not consider communication failures. Current implementations of distributed mutual exclusion use token- or permission-based methods. Dynamic participation amplifies the lost token problem in token-based approaches, while limited knowledge of the number of nodes makes obtaining quora and consensus in permission-based approaches impossible, rendering both mutual exclusion implementations impractical. This paper presents the CwoRIS protocol which enables short-term scheduling in real-time within an environment with dynamic participants. It motivates the need to support dynamic participants by means of a scenario for autonomous vehicle coordination in intersection crossing. The paper shows that the protocol is able to work in an environment with message loss and argues its correctness by showing mutual exclusion: there are no cases in which two nodes have access to the same resources at the same time.

[1]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[2]  André Schiper,et al.  Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks , 2008, 2008 Symposium on Reliable Distributed Systems.

[3]  Vinny Cahill,et al.  STEAM: event-based middleware for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[4]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[5]  Rolf Naumann,et al.  Focus: Managing Autonomous Vehicles at Intersections , 1998, IEEE Intell. Syst..

[6]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[7]  Peter Stone,et al.  Replacing the stop sign: unmanaged intersection control for autonomous vehicles , 2008, AAMAS.

[8]  S. David Wu,et al.  On combinatorial auction and Lagrangean relaxation for distributed resource scheduling , 1999 .

[9]  Jacques Jorda,et al.  How to use multicast in distributed mutual exclusion algorithms for grid file systems , 2009, 2009 International Conference on High Performance Computing & Simulation.

[10]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[11]  Kurt Dresner Autonomous Intersection Management , 2009 .

[12]  Jiannong Cao,et al.  A fault tolerant mutual exclusion algorithm for mobile ad hoc networks , 2008, Pervasive Mob. Comput..

[13]  V. Cahill,et al.  Exploiting space/time trade-offs in real-time mobile ad hoc networks , 2009 .

[14]  Nancy A. Lynch,et al.  Reconciling the theory and practice of (un)reliable wireless broadcast , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[15]  Peter Stone,et al.  Multiagent traffic management: an improved intersection control mechanism , 2005, AAMAS '05.

[16]  Vinny Cahill,et al.  Membership service specifications for safety-critical geocast in vehicular networks , 2010, 2010 7th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010).

[17]  Mukesh Singhal,et al.  A fault tolerant algorithm for distributed mutual exclusion , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[18]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[19]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[20]  Hagit Attiya,et al.  Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks , 2010, IEEE Trans. Mob. Comput..