{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:37:43Z","timestamp":1743089863555,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91014-3_5","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"71-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fault-Tolerant Termination Detection with Safra\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Karlos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Per","family":"Fuchs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"1\u20132","key":"5_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(96)00286-1","volume":"186","author":"Y Afek","year":"1997","unstructured":"Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its applications to self-stabilization. Theoret. Comput. Sci. 186(1\u20132), 199\u2013229 (1997)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"5_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MC.2010.184","volume":"43","author":"HE Bal","year":"2010","unstructured":"Bal, H.E., et al.: Real-world distributed computer with Ibis. IEEE Comput. 43(8), 54\u201362 (2010)","journal-title":"IEEE Comput."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MC.2016.127","volume":"49","author":"HE Bal","year":"2016","unstructured":"Bal, H.E., et al.: A medium-scale distributed system for computer science research: infrastructure for the long term. IEEE Comput. 49(5), 54\u201363 (2016)","journal-title":"IEEE Comput."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"11","key":"5_CR5","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1145\/358690.358717","volume":"25","author":"KM Chandy","year":"1982","unstructured":"Chandy, K.M., Misra, J.: Distributed computation on graphs: shortest path algorithms. Commun. ACM 25(11), 833\u2013837 (1982)","journal-title":"Commun. ACM"},{"key":"5_CR6","unstructured":"Demirbas, M., Arora, A.: An optimal termination detection algorithm for rings, Technical report, The Ohio State University (2000)"},{"key":"5_CR7","unstructured":"Dijkstra, E.W.: Shmuel Safra\u2019s version of termination detection. EWD Manuscript 998, The University of Texas at Austin (1987)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"EW Dijkstra","year":"1983","unstructured":"Dijkstra, E.W., Feijen, W.H.J., van Gasteren, A.J.M.: Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16, 217\u2013219 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"EW Dijkstra","year":"1980","unstructured":"Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Inf. Process. Lett. 11(1), 1\u20134 (1980)","journal-title":"Inf. Process. Lett."},{"key":"5_CR10","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-1-4757-3126-2_29","volume-title":"On a Method of Multiprogramming","author":"WHJ Feijen","year":"1999","unstructured":"Feijen, W.H.J., van Gasteren, A.J.M.: Shmuel Safra\u2019s termination detection algorithm. In: Feijen, W.H.J., van Gasteren, A.J.M. (eds.) On a Method of Multiprogramming. Monographs in Computer Science, pp. 313\u2013332. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3126-2_29"},{"key":"5_CR11","volume-title":"Distributed Algorithms: An Intuitive Approach","author":"WJ Fokkink","year":"2018","unstructured":"Fokkink, W.J.: Distributed Algorithms: An Intuitive Approach, 2nd edn. MIT Press, Cambridge (2018)","edition":"2"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N Francez","year":"1980","unstructured":"Francez, N.: Distributed termination. ACM Trans. Program. Lang. Syst. 2, 42\u201355 (1980)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"9","key":"5_CR13","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/71.879773","volume":"11","author":"J-M Helary","year":"2000","unstructured":"Helary, J.-M., Hurfin, M., Mostefaoui, A., Raynal, M., Tronel, F.: Computing global functions in asynchronous distributed systems with perfect failure detectors. IEEE Trans. Parallel Distrib. Syst. 11(9), 897\u2013907 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Hursey, J., Graham, R.L.: Building a fault tolerant MPI application: a ring communication example. In: Proceedings of IPDPS Workshop on High Performance Computing, pp. 1549\u20131556. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.308"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/71.363410","volume":"6","author":"T-H Lai","year":"1995","unstructured":"Lai, T.-H., Wu, L.-F.: An (N-1)-resilient algorithm for distributed termination detection. IEEE Trans. Parallel Distrib. Syst. 6(1), 63\u201378 (1995)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Lifflander, J., Miller, P., Kale, L.: Adoption protocols for fanout-optimal fault-tolerant termination detection. In: Proceedings of PPoPP, pp. 13\u201322. ACM (2013)","DOI":"10.1145\/2517327.2442519"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0164-1212(98)10034-1","volume":"43","author":"J Matocha","year":"1998","unstructured":"Matocha, J., Camp, T.: A taxonomy of distributed termination detection algorithms. J. Syst. Softw. 43(3), 207\u2013221 (1998)","journal-title":"J. Syst. Softw."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F Mattern","year":"1987","unstructured":"Mattern, F.: Algorithms for distributed termination detection. Distrib. Comput. 2(3), 161\u2013175 (1987). https:\/\/doi.org\/10.1007\/BF01782776","journal-title":"Distrib. Comput."},{"issue":"4","key":"5_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(89)90212-3","volume":"30","author":"F Mattern","year":"1989","unstructured":"Mattern, F.: Global quiescence detection based on credit distribution and recovery. Inf. Process. Lett. 30(4), 195\u2013200 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"5_CR20","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.jpdc.2008.02.001","volume":"68","author":"N Mittal","year":"2008","unstructured":"Mittal, N., Freiling, F., Venkatesan, S., Penso, L.: On termination detection in crash-prone distributed systems with failure detectors. J. Parallel Distrib. Comput. 68(6), 855\u2013875 (2008)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"2000","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1006\/jpdc.1995.1025","volume":"25","author":"TC Tseng","year":"1995","unstructured":"Tseng, T.C.: Detecting termination by weight-throwing in a faulty distributed system. J. Parallel Distrib. Comput. 25(1), 7\u201315 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/24.24583","volume":"38","author":"S Venkatesan","year":"1989","unstructured":"Venkatesan, S.: Reliable protocols for distributed termination detection. IEEE Trans. Reliab. 38(1), 103\u2013110 (1989)","journal-title":"IEEE Trans. Reliab."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:04:04Z","timestamp":1638353044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"32","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":"15","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":"2","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":"47% - 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":"2,84","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)"}}]}}