Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Han, K., Ravindran, B., Jensen, E.D.: RTG-L: dependably scheduling real-time distributable threads in large-scale, unreliable networks. In: Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing (PRDC) (2007)
Zhang, B., Han, K., Ravindran, B., Jensen, E.D.: RTQG: real-time quorum- based gossip protocol for unreliable networks. In: Proceedings of the Third International Conference on Availability, Reliability and Security (2008)
Han, K., et al.: Exploiting slack for scheduling dependent, distributable real-time threads in mobile ad hoc networks. In: RTNS, March 2007
Huang, F., Han, K., Ravindran, B., Jensen, E.D.: Integrated real-time scheduling and communication with probabilistic timing assurances in unreliable distributed systems. In: 13th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2008), Belfast, pp. 79–88 (2008). https://doi.org/10.1109/iceccs.2008.15
Wu, H., Ravindran, B., Jensen, E.D.: Energy-efficient, utility accrual real-time scheduling under the unimodal arbitrary arrival model. In: Proceedings of Design, Automation and Test in Europe (2005)
Jensen, E.D., et al.: A time-driven scheduling model for real-time systems. In: RTSS, pp. 112–122, December 1985
Bettati, R.: End-to-end scheduling to meet deadlines in distributed systems. Ph.D. thesis, UIUC (1994)
Reiter, M.K., Samar, A., Wang, C.: Distributed construction of a fault-tolerant network from a tree. In: Proceedings of the 2005 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005) (2005)
Kasprzyk, R.: Diffusion in networks. J, Telecommun. Inf. Technol. 2012(2), 99–106 (2012)
Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: expanders, push vs. pull, and robustness. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 366–377. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02927-1_31
Shah, D.: Gossip algorithms. Found. Trends Netw. 3(1), 1–125 (2008). https://doi.org/10.1561/1300000014
Wijetunge, U., Perreau, S., Pollok, A.: Distributed stochastic routing optimization using expander graph theory. In: IEEE Australian Communication Theory Workshop AusCTW (2011)
Chatterjee, M., Setua, S.K.: Gossip-based real-time task scheduling using expander graph. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds.) Advanced Computing and Systems for Security. AISC, vol. 897, pp. 3–14. Springer, Singapore (2019). https://doi.org/10.1007/978-981-13-3250-0_1
Chatterjee, M., Mitra, A., Roy, S., et al.: Gossip based fault tolerant protocol in distributed transactional memory using quorum based replication system. Cluster Comput. (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chatterjee, M., Mitra, A., Roy, S., Roy, S., Shah, H., Setua, S.K. (2019). Gossip Based Distributed Real Time Task Scheduling with Guaranteed Performance on Heterogeneous Networks. In: Madria, S., Fournier-Viger, P., Chaudhary, S., Reddy, P. (eds) Big Data Analytics. BDA 2019. Lecture Notes in Computer Science(), vol 11932. Springer, Cham. https://doi.org/10.1007/978-3-030-37188-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-37188-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-37187-6
Online ISBN: 978-3-030-37188-3
eBook Packages: Computer ScienceComputer Science (R0)