{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:53Z","timestamp":1759638893866},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922940"},{"type":"electronic","value":"9783540922957"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92295-7_31","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T08:00:00Z","timestamp":1237968000000},"page":"251-262","source":"Crossref","is-referenced-by-count":13,"title":["Two Consensus Algorithms with Atomic Registers and Failure Detector \u03a9"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"31_CR2","first-page":"163","volume":"4","author":"M. Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research\u00a04, 163\u2013183 (1987)","journal-title":"Advances in Computing Research"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"key":"31_CR5","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.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 280\u2013295. Springer, Heidelberg (1994)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Koutnetzov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: 23th ACM Symposium on Principles of Distributed Computing (2004)","DOI":"10.1145\/1011767.1011818"},{"key":"31_CR7","unstructured":"Koutnetzov, P.: Synchronisation using failure detector. Technical report, PhD Thesis, EPFL (2005)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing 0mega with weak reliability and synchrony assumptions. In: 22th ACM Symposium on Principles of Distributed Computing, pp. 306\u2013314 (2003)","DOI":"10.1145\/872035.872081"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11561927_16","volume-title":"Distributed Computing","author":"D. Malkhi","year":"2005","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: Omega meets paxos: Leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 199\u2013213. Springer, Heidelberg (2005)"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The Part-Time parliament. ACM Transactions on Computer Systems\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-40026-5_22","volume-title":"Distributed Computing","author":"E. Gafni","year":"2000","unstructured":"Gafni, E., Lamport, L.: Disk paxos. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 330\u2013344. Springer, Heidelberg (2000)"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00446-005-0123-x","volume":"18","author":"G. Chockler","year":"2005","unstructured":"Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. Distributed Computing\u00a018(1), 73\u201384 (2005)","journal-title":"Distributed Computing"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing paxos. Distributed Computing Column of ACM SIGACT News\u00a034(1) (2003)","DOI":"10.1145\/637437.637447"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Reconstructing paxos. Distributed Computing Column of ACM SIGACT News\u00a034(2) (2003)","DOI":"10.1145\/637437.637447"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1093\/comjnl\/bxl046","volume":"50","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Raynal, M.: The alpha of indulgent consensus. Comput. J.\u00a050(1), 53\u201367 (2007)","journal-title":"Comput. J."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0129626401000452","volume":"11","author":"A. Most\u00e9faoui","year":"2001","unstructured":"Most\u00e9faoui, A., Raynal, M.: Leader-based consensus. Parallel Processing Letters\u00a011(1), 95\u2013107 (2001)","journal-title":"Parallel Processing Letters"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: 23rd International Conference on Distributed Computing Systems (ICDCS), Providence, RI, USA (2003)","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Chor, B., Israeli, A., Li, M.: On processor coordination using asynchronous hardware. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pp. 222\u2013231 (1987)","DOI":"10.1145\/41840.41848"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/62546.62594","volume-title":"PODC 1988: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing","author":"K. Abrahamson","year":"1988","unstructured":"Abrahamson, K.: On achieving consensus using a shared memory. In: PODC 1988: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, pp. 291\u2013302. ACM Press, New York (1988)"},{"issue":"3","key":"31_CR20","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. Journal of Algorithms\u00a011(3), 441\u2013461 (1990)","journal-title":"Journal of Algorithms"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"issue":"3","key":"31_CR22","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"31_CR23","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"5-6","key":"31_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0190(00)00027-2","volume":"73","author":"A. Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui, A., Raynal, M., Tronel, F.: From binary consensus to multivalued consensus in asynchronous message-passing systems. Inf. Process. Lett.\u00a073(5-6), 207\u2013212 (2000)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92295-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T02:18:58Z","timestamp":1558232338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92295-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922940","9783540922957"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92295-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}