{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:16:17Z","timestamp":1742973377894,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030371876"},{"type":"electronic","value":"9783030371883"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37188-3_15","type":"book-chapter","created":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T15:24:22Z","timestamp":1576164262000},"page":"245-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gossip Based Distributed Real Time Task Scheduling with Guaranteed Performance on Heterogeneous Networks"],"prefix":"10.1007","author":[{"given":"Moumita","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somasis","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirav","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjit Kr.","family":"Setua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/PRDC.2007.57"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/ARES.2008.139"},{"key":"15_CR3","unstructured":"Han, K., et al.: Exploiting slack for scheduling dependent, distributable real-time threads in mobile ad hoc networks. In: RTNS, March 2007"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"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\u201388 (2008). https:\/\/doi.org\/10.1109\/iceccs.2008.15","DOI":"10.1109\/iceccs.2008.15"},{"key":"15_CR5","unstructured":"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)"},{"key":"15_CR6","unstructured":"Jensen, E.D., et al.: A time-driven scheduling model for real-time systems. In: RTSS, pp. 112\u2013122, December 1985"},{"key":"15_CR7","unstructured":"Bettati, R.: End-to-end scheduling to meet deadlines in distributed systems. Ph.D. thesis, UIUC (1994)"},{"key":"15_CR8","unstructured":"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)"},{"issue":"2","key":"15_CR9","first-page":"99","volume":"2012","author":"R Kasprzyk","year":"2012","unstructured":"Kasprzyk, R.: Diffusion in networks. J, Telecommun. Inf. Technol. 2012(2), 99\u2013106 (2012)","journal-title":"J, Telecommun. Inf. Technol."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-02927-1_31","volume-title":"Automata, Languages and Programming","author":"B Doerr","year":"2009","unstructured":"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\u2013377. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_31"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1300000014","volume":"3","author":"D Shah","year":"2008","unstructured":"Shah, D.: Gossip algorithms. Found. Trends Netw. 3(1), 1\u2013125 (2008). https:\/\/doi.org\/10.1561\/1300000014","journal-title":"Found. Trends Netw."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Wijetunge, U., Perreau, S., Pollok, A.: Distributed stochastic routing optimization using expander graph theory. In: IEEE Australian Communication Theory Workshop AusCTW (2011)","DOI":"10.1109\/AUSCTW.2011.5728749"},{"key":"15_CR13","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-13-3250-0_1","volume-title":"Advanced Computing and Systems for Security","author":"M Chatterjee","year":"2019","unstructured":"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\u201314. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-3250-0_1"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/s10586-019-02973-7"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37188-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:17:43Z","timestamp":1710166663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-37188-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030371876","9783030371883"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37188-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ahmedabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigda2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bda2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12 other papers were accepted and are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}