{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:16:31Z","timestamp":1726038991523},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030256357"},{"type":"electronic","value":"9783030256364"}],"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-25636-4_33","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"419-430","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Participant-Restricted Consensus in Asynchronous Crash-Prone Read\/Write Systems and Its Weakest Failure Detector"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. JACM 40(4), 873\u2013890 (1993)","journal-title":"JACM"},{"issue":"4","key":"33_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"J Anderson","year":"1994","unstructured":"Anderson, J.: Multi-writer composite registers. Distrib. Comput. 7(4), 175\u2013195 (1994)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley-Interscience, p. 414 (2004). ISBN 0-471-45324-2","key":"33_CR3","DOI":"10.1002\/0471478210"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols. In: Proceedings of 2nd ACM Symposium on Principles of Distributed Computing (PODC 1983), pp. 27\u201330. ACM Press (1983)","key":"33_CR4","DOI":"10.1145\/800221.806707"},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T Chandra","year":"1996","unstructured":"Chandra, T., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"33_CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/1734213.1734216","volume":"57","author":"C Delporte-Gallet","year":"2010","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4), 32 (2010). Article 22","journal-title":"J. ACM"},{"issue":"4","key":"33_CR8","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/s00453-008-9190-2","volume":"56","author":"A Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez, A., Jim\u00e9nez, E., Raynal, M., Tr\u00e9dan, G.: A timing assumption and two $$t$$ -resilient protocols for implementing an eventual leader service in asynchronous shared-memory systems. Algorithmica 56(4), 550\u2013576 (2010)","journal-title":"Algorithmica"},{"issue":"6","key":"33_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00446-007-0046-9","volume":"20","author":"R Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M., Kuznetsov, P.: The weakest failure detectors to boost obstruction-freedom. Distrib. Comput. 20(6), 415\u2013433 (2008)","journal-title":"Distrib. Comput."},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"9","key":"33_CR11","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/71.879773","volume":"11","author":"J-M H\u00e9lary","year":"2000","unstructured":"H\u00e9lary, J.-M., Hurfin, M., Most\u00e9faoui, A., Raynal, M., Tronel, F.: Computing global functions in asynchronous distributed systems with perfect failure detectors. IEEE Trans. Parallel Distrib. Syst. 11(9), 897\u2013909 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BFb0020440","volume-title":"Distributed Algorithms","author":"W-K Lo","year":"1994","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 280\u2013295. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0020440"},{"key":"33_CR13","first-page":"163","volume-title":"Advances in Computing Research","author":"M Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata, F.P. (ed.) Advances in Computing Research, vol. 4, pp. 163\u2013183. JAI Press, Greenwich (1987)"},{"key":"33_CR14","first-page":"872","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms, p. 872. Morgan Kaufmann Pub., San Francisco (1996)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-48169-9_4","volume-title":"Distributed Computing","author":"A Most\u00e9faoui","year":"1999","unstructured":"Most\u00e9faoui, A., Raynal, M.: Solving consensus using Chandra-Toueg\u2019s unreliable failure detectors: a general quorum-based approach. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 49\u201363. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48169-9_4"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent Programming: Algorithms, Principles, and Foundations","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles, and Foundations, p. 515. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-32027-9"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach","author":"M Raynal","year":"2018","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach, p. 492. Springer, Switzerland (2018). https:\/\/doi.org\/10.1007\/978-3-319-94141-7"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11945529_2","volume-title":"Principles of Distributed Systems","author":"M Raynal","year":"2006","unstructured":"Raynal, M., Travers, C.: In search of the holy grail: looking for the weakest failure detector for wait-free set agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 3\u201319. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11945529_2"},{"key":"33_CR19","first-page":"423","volume-title":"Synchronization Algorithms and Concurrent Programming","author":"G Taubenfeld","year":"2006","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, p. 423. Upper Saddle River, Pearson Education\/Prentice Hall (2006)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25636-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T18:01:19Z","timestamp":1610733679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25636-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030256357","9783030256364"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25636-4_33","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":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PaCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Computing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Almaty","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazakhstan","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":"19 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pact2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssd.sscc.ru\/conference\/pact2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}