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 a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2007 IEEE Wireless Communications and Networking Conference S. 4307 - 4312
Hauptverfasser: Kai Han, Ravindran, B., Jensen, E.D.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.03.2007
Schlagworte:
Ad hoc networks
Communications Society
Dynamic scheduling
Peer to peer computing
Scheduling algorithm
Subscriptions
Time factors
Uncertainty
USA Councils
Yarn
ISBN:1424406587, 9781424406586
ISSN:1525-3511
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISBN:1424406587
9781424406586
ISSN:1525-3511
DOI:10.1109/WCNC.2007.786