Gossip Based Distributed Real Time Task Scheduling with Guaranteed Performance on Heterogeneous Networks

This paper considers the scheduling of distributable real time tasks in dynamic networks which are prone to failures and do not have a fixed network infrastructure. We propose a distributable scheduling algorithm using gossip called GBTS-F for reliable and dynamic discovery of appropriate nodes which can execute the tasks. GBTS-F uses the slack time of the tasks for optimizing the gossiping duration and thus satisfies the each task timing constraints with probabilistic guarantee. Even though gossip protocols are usually fault tolerant but to handle byzantine faults and to control the high message complexity incurred during gossiping we propose to use an expander graph. Performance analysis and simulation results show that GBTS-F performs better than other state of art algorithms in terms of message complexity and task success probability.