{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:45:42Z","timestamp":1725813942990},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_32","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"485-500","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Distributed Universal Construction with Unknown Participants"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Sutra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9tienne","family":"Rivi\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Felber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"32_CR1","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 Trans. Comput. Syst.\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"32_CR3","first-page":"1","volume-title":"Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, NSDI 2012","author":"M. Balakrishnan","year":"2012","unstructured":"Balakrishnan, M., Malkhi, D., Prabhakaran, V., Wobber, T., Wei, M., Davis, J.D.: Corfu: A shared log design for flash clusters. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, NSDI 2012, pp. 1\u20131. USENIX Association, Berkeley (2012)"},{"key":"32_CR4","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)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Balakrishnan, M., Malkhi, D., Wobber, T., Wu, M., Prabhakaran, V., Wei, M., Davis, J.D., Rao, S., Zou, T., Zuck, A.: Tango: Distributed data structures over a shared log. In: 24th ACM Symposium on Operating Systems Principles, SOSP (2013)","DOI":"10.1145\/2517349.2522732"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/277697.277724","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1998","author":"E. Gafni","year":"1998","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1998, pp. 143\u2013152. ACM, New York (1998)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1145\/1835698.1835802","volume-title":"Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010","author":"J. Aspnes","year":"2010","unstructured":"Aspnes, J.: A modular approach to shared-memory consensus, with applications to the probabilistic-write model. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, pp. 460\u2013467. ACM, New York (2010)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Lakshman, A., Malik, P.: Cassandra: A decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44(2) (April 2010)","DOI":"10.1145\/1773912.1773922"},{"key":"32_CR9","first-page":"4","volume-title":"PODC 2009: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing","author":"F.P. Junqueira","year":"2009","unstructured":"Junqueira, F.P., Reed, B.C.: The life and times of a ZooKeeper. In: PODC 2009: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 4\u20134. ACM, New York (2009)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Sutra, P., Rivi\u00e8re, E., Felber, P.: A practical distributed universal construction with unknown participants. CoRR abs\/1309.2772 (2013)","DOI":"10.1007\/978-3-319-14472-6_32"},{"issue":"2","key":"32_CR11","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., Patterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"32_CR12","first-page":"289","volume-title":"PODC 2000","author":"R. Guerraoui","year":"2000","unstructured":"Guerraoui, R.: Indulgent algorithms (preliminary version). In: PODC 2000, pp. 289\u2013297. ACM, New York (2000)"},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TC.2004.1268403","volume":"53","author":"R. Guerraoui","year":"2004","unstructured":"Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Trans. Comput.\u00a053(4), 453\u2013466 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/571825.571837","volume-title":"Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, PODC 2002","author":"G. Chockler","year":"2002","unstructured":"Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, PODC 2002, pp. 78\u201387. ACM, New York (2002)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P.: The complexity of obstruction-free implementations. J. ACM\u00a056(4), 24:1\u201324:33 (2009)","DOI":"10.1145\/1538902.1538908"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Ellen, F.: Tight bounds for anonymous adopt-commit objects. In: 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 317\u2013324 (June 2011)","DOI":"10.1145\/1989493.1989548"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-39989-6_4","volume-title":"Distributed Computing","author":"V. Luchangco","year":"2003","unstructured":"Luchangco, V., Moir, M., Shavit, N.N.: On the uncontended complexity of consensus. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 45\u201359. Springer, Heidelberg (2003)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11561927_8","volume-title":"Distributed Computing","author":"F.E. Fich","year":"2005","unstructured":"Fich, F.E., Luchangco, V., Moir, M., Shavit, N.N.: Obstruction-free algorithms can be practically wait-free. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 78\u201392. Springer, Heidelberg (2005)"},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P. Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM J. Comput.\u00a030(2), 438\u2013456 (2000)","journal-title":"SIAM J. Comput."},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-56188-9_5","volume-title":"Distributed Algorithms","author":"P. Jayanti","year":"1992","unstructured":"Jayanti, P., Toueg, S.: Some results on the impossibility, universality, and decidability of consensus. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol.\u00a0647, pp. 69\u201384. Springer, Heidelberg (1992)"},{"issue":"1","key":"32_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"key":"32_CR22","unstructured":"Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS 1997). IEEE Computer Society, Washington, DC (1997)"},{"issue":"3","key":"32_CR23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: A correcteness condition for concurrent objects. ACM Trans. on Prog. Lang.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. on Prog. Lang."},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-25873-2_22","volume-title":"Principles of Distributed Systems","author":"M. Herlihy","year":"2011","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 313\u2013328. Springer, Heidelberg (2011)"},{"issue":"1","key":"32_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. Comput. Syst.\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Trans. Comput. Syst."},{"key":"32_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0020430","volume-title":"Distributed Algorithms","author":"M. Moir","year":"1994","unstructured":"Moir, M., Anderson, J.: Fast, long-lived renaming. In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 141\u2013155. Springer, Heidelberg (1994)"},{"issue":"3","key":"32_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-007-0042-0","volume":"20","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distributed Computing\u00a020(3), 165\u2013177 (2007)","journal-title":"Distributed Computing"},{"issue":"2","key":"32_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004460100067","volume":"15","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing\u00a015(2), 87\u201396 (2002)","journal-title":"Distributed Computing"},{"key":"32_CR29","unstructured":"Sutra, P.: (2013), http:\/\/github.com\/otrack\/pssolib"},{"key":"32_CR30","volume-title":"Probability, Statistics, and Queueing Theory with Computer Science Applications","author":"A.O. Allen","year":"1990","unstructured":"Allen, A.O.: Probability, Statistics, and Queueing Theory with Computer Science Applications. Academic Press Professional, Inc., San Diego (1990)"},{"issue":"2","key":"32_CR31","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/850657.850659","volume":"13","author":"M. Blasgen","year":"1979","unstructured":"Blasgen, M., Gray, J., Mitoma, M., Price, T.: The convoy phenomenon. SIGOPS Oper. Syst. Rev.\u00a013(2), 20\u201325 (1979)","journal-title":"SIGOPS Oper. Syst. Rev."}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T03:04:49Z","timestamp":1650769489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}