{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:52:53Z","timestamp":1725483173698},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000730"},{"type":"electronic","value":"9783540361084"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-36108-1_9","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:38:36Z","timestamp":1178224716000},"page":"133-147","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Universal Construction for Message-Passing Systems"],"prefix":"10.1007","author":[{"given":"Partha","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svend","family":"Fr\u00f8lund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bastian","family":"Pochon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"9_CR1","unstructured":"P. A. Alsberg and J. D. Day. A principle for resilient sharing of distributed resources. In Proceedings of the Second IEEE International Conference on Software Engineering (ICSE), 1976."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124\u2013142, 1995.","journal-title":"Journal of the ACM"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"J. F. Bartlett. A nonstop kernel. In Proceedings of the 8\n                        \n                  th\n                \n                        ACM Symposium on Operating System Principles (SOSP), 1981.","DOI":"10.1145\/800216.806587"},{"key":"9_CR4","unstructured":"R. Boichat, P. Dutta, S. Fr\u00f8lund, and R. Guerraoui. Deconstructing Paxos. Technical Report EPFL-2001, Swiss Federal Institute of Technology, January 2001."},{"key":"9_CR5","unstructured":"N. Budhiraja, K. Marzullo, F. B. Schneider, and S. Toueg. The primary-backup approach. In S. Mullender, editor, Distributed Systems. Addison-Wesley, 1993."},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. Chandra","year":"1996","unstructured":"T. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector to solve consensus. Journal of the ACM, 43(4):685\u2013722, 1996.","journal-title":"Journal of the ACM"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In Proceedings of the 21\n                        \n                  st\n                \n                        ACM Symposium on Principles of Distributed Computing (PODC) (to appear), July 2002.","DOI":"10.1145\/571825.571837"},{"key":"9_CR8","unstructured":"X. D\u00e9fago and A. Schiper. Semi-passive replication and lazy consensus. Technical Report DSC\/2000\/012, Swiss Federal Institute of Technology, February 2000."},{"key":"9_CR9","volume-title":"Technical Report EPFL\/IC\/2002\/28","author":"P. Dutta","year":"2002","unstructured":"P. Dutta, F. Fr\u00f8lund, R. Guerraoui, and B. Pochon. An efficient universal construction for message-passing systems. Technical Report EPFL\/IC\/2002\/28, Swiss Federal Institute of Technoology, Lausanne, May 2002."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"E. Gafni and L. Lamport. Disk paxos. In International Symposium on Distributed Computing, pages 330\u2013344, 2000.","DOI":"10.1007\/3-540-40026-5_22"},{"key":"9_CR11","unstructured":"R. Guerraoui. Indulgent algorithms. In Proceedings of the 19\n                        \n                  th\n                \n                        ACM Symposium on Principles of Distributed Computing (PODC), 2000."},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124\u2013149, January 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"9_CR13","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463\u2013492, July 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"L. Lamport. The part-time parliament. Technical Report 49, DEC Systems Research Center, 1989. Also published in ACM Transactions on Computer Systems (TOCS), Vol. 16, No. 2, 1998.","DOI":"10.1145\/279227.279229"},{"key":"9_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the International Workshop on Distributed Algorithms (WDAG), Springer-Verlag","author":"B. Lampson","year":"1996","unstructured":"B. Lampson. How to build a highly available system using consensus. In Proceedings of the International Workshop on Distributed Algorithms (WDAG), Springer-Verlag, LNCS, September 1996."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"J. Yang, G. Neiger, and E. Gafni. Structured derivations of consensus algorithms for failure detectors. In Proceedings of the 17\n                        \n                  th\n                \n                        ACM Symposium on Principles of Distributed Computing, pages 297\u2013306, 1998.","DOI":"10.1145\/277697.277755"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36108-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:50:40Z","timestamp":1578523840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_9"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"24 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}