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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2007 IEEE Wireless Communications and Networking Conference s. 4307 - 4312
Hlavní autoři: Kai Han, Ravindran, B., Jensen, E.D.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2007
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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