Probabilistic, Real-Time Scheduling of Distributable Threads Under Dependencies in Mobile, Ad Hoc Networks

We consider scheduling distributable real-time threads that are subject to dependencies (e.g., due to mutual exclusion constraints) in ad hoc networks, in the presence of node and link failures, message losses, and dynamic node joins and departures. We present a gossip-based distributed scheduling algorithm, called RTG-D. We prove that thread blocking times under RTG-D are probabilistically bounded, thereby probabilistically bounding thread time constraint satisfactions´. Our simulation results validate RTG-D´s effectiveness.