{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T21:40:57Z","timestamp":1684359657254},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T00:00:00Z","timestamp":1208563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00453-008-9190-2","type":"journal-article","created":{"date-parts":[[2008,4,18]],"date-time":"2008-04-18T17:51:40Z","timestamp":1208541100000},"page":"550-576","source":"Crossref","is-referenced-by-count":13,"title":["A Timing Assumption and Two t-Resilient Protocols for\u00a0Implementing an Eventual Leader Service in\u00a0Asynchronous Shared Memory Systems"],"prefix":"10.1007","volume":"56","author":[{"given":"Antonio","family":"Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernesto","family":"Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Tr\u00e9dan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,19]]},"reference":[{"key":"9190_CR1","first-page":"226","volume-title":"Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC\u201904)","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Chockler, G.V., Keidar, I., Malkhi, D.: Byzantine disk Paxos, optimal resilience with Byzantine shared memory. In: Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC\u201904), pp. 226\u2013235. ACM Press, New York (2004)"},{"key":"9190_CR2","first-page":"306","volume-title":"Proc. 22th ACM Symposium on Principles of Distributed Computing (PODC\u201903)","author":"M.K. Aguilera","year":"2003","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing omega with weak reliability and synchrony assumptions. In: Proc. 22th ACM Symposium on Principles of Distributed Computing (PODC\u201903), pp. 306\u2013314. ACM Press, New York (2003)"},{"key":"9190_CR3","first-page":"328","volume-title":"Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC\u201904)","author":"M.K. Aguilera","year":"2004","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC\u201904), pp. 328\u2013337. ACM Press, New York (2004)"},{"key":"9190_CR4","first-page":"315","volume-title":"Proc. 21th ACM Symposium on Principles of Distributed Computing (PODC\u201903)","author":"M.K. Aguilera","year":"2003","unstructured":"Aguilera, M.K., Englert, B., Gafni, E.: On using network attached disks as shared memory. In: Proc. 21th ACM Symposium on Principles of Distributed Computing (PODC\u201903), pp. 315\u2013324. ACM Press, New York (2003)"},{"issue":"2","key":"9190_CR5","doi-asserted-by":"crossref","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. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"9190_CR6","doi-asserted-by":"crossref","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. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"9190_CR7","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"9190_CR8","first-page":"399","volume-title":"Proc. 37th International IEEE Conference on Dependable Systems and Networks (DSN\u201907)","author":"A. Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, A., Jim\u00e9nez, E., Raynal, M.: Electing an eventual leader in an asynchronous shared memory system. In: Proc. 37th International IEEE Conference on Dependable Systems and Networks (DSN\u201907), pp. 399\u2013408. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"1","key":"9190_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-002-0070-8","volume":"16","author":"E. Gafni","year":"2003","unstructured":"Gafni, E., Lamport, L.: Disk Paxos. Distrib. Comput. 16(1), 1\u201320 (2003)","journal-title":"Distrib. Comput."},{"key":"9190_CR10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/291069.291029","volume-title":"Proc. 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201998)","author":"G.A. Gibson","year":"1998","unstructured":"Gibson, G.A., Nagle, D., Amiri, K., Butler, J., Chang, F.W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., Zelenka, J.: A cost-effective high-bandwidth storage architecture. In: Proc. 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201998), pp. 92\u2013103. ACM Press, New York (1998)"},{"key":"9190_CR11","series-title":"Lecture Notes in Computer Science","first-page":"376","volume-title":"Proc. 20th Symposium on Distributed Computing (DISC\u201906)","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detectors to boost obstruction-freedom. In: Proc. 20th Symposium on Distributed Computing (DISC\u201906). Lecture Notes in Computer Science, vol.\u00a04167, pp.\u00a0376\u2013390. Springer, Berlin (2006)"},{"issue":"4","key":"9190_CR12","doi-asserted-by":"crossref","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. 53(4), 453\u2013466 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"9190_CR13","first-page":"75","volume-title":"4th International IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS\u201906)","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Raynal, M.: A leader election protocol for eventually synchronous shared memory systems. In: 4th International IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS\u201906), pp. 75\u201380. IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"1","key":"9190_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1093\/comjnl\/bxl046","volume":"50","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Raynal, M.: The alpha of asynchronous consensus. Comput. J. 50(1), 53\u201367 (2007)","journal-title":"Comput. J."},{"issue":"1","key":"9190_CR15","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 11(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9190_CR16","first-page":"522","volume-title":"Proc. 23th IEEE International Conference on Distributed Computing Systems (ICDCS\u201903)","author":"M.P. Herlihy","year":"2003","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: Proc. 23th IEEE International Conference on Distributed Computing Systems (ICDCS\u201903), pp.\u00a0522\u2013529. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"9190_CR17","first-page":"92","volume-title":"Proc. 21th ACM Symposium on Principles of Distributed Computing (PODC\u201903)","author":"M.P. Herlihy","year":"2003","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic sized data structure. In: Proc. 21th ACM Symposium on Principles of Distributed Computing (PODC\u201903), pp. 92\u2013101. ACM Press, New York (2003)"},{"issue":"3","key":"9190_CR18","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"9190_CR19","doi-asserted-by":"crossref","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. 16(2), 133\u2013169 (1998) (the first version of Paxos appeared a DEC Tech Report in 1989)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9190_CR20","first-page":"52","volume-title":"Proc. 19th Symposium on Resilient Distributed Systems (SRDS\u201900)","author":"M. Larrea","year":"2000","unstructured":"Larrea, M., Fern\u00e1ndez, A., Ar\u00e9valo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: Proc. 19th Symposium on Resilient Distributed Systems (SRDS\u201900), pp. 52\u201360. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"9190_CR21","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/237090.237157","volume-title":"Proc. 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201996)","author":"E.K. Lee","year":"1996","unstructured":"Lee, E.K., Thekkath, C.: Petal: distributed virtual disks. In: Proc. 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201996), pp. 84\u201392. ACM Press, New York (1996)"},{"key":"9190_CR22","series-title":"Lecture Notes in Computer Science","first-page":"280","volume-title":"Proc. 8th International Workshop on Distributed Computing (WDAG\u201994)","author":"W.-K. Lo","year":"1994","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared memory systems. In: Proc. 8th International Workshop on Distributed Computing (WDAG\u201994). Lecture Notes in Computer Science, vol.\u00a0857, pp.\u00a0280\u2013295. Springer, Berlin (1994)"},{"key":"9190_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/11561927_16","volume-title":"Proc. 19th International Symposium on Distributed Computing (DISC\u201905)","author":"D. Malkhi","year":"2005","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: \u03a9 meets Paxos: leader election and stability without eventual timely links. In: Proc. 19th International Symposium on Distributed Computing (DISC\u201905). Lecture Notes in Computer Science, vol.\u00a03724, pp.\u00a0199\u2013213. Springer, Berlin (2005)"},{"key":"9190_CR24","doi-asserted-by":"crossref","unstructured":"Mills, D.L.: Network Time Protocol (Version 3). Request for Comments (RFC) 1305, March 1992","DOI":"10.17487\/rfc1361"},{"key":"9190_CR25","first-page":"351","volume-title":"Proc. International IEEE Conference on Dependable Systems and Networks (DSN\u201903)","author":"A. Mostefaoui","year":"2003","unstructured":"Mostefaoui, A., Mourgaya, E., Raynal, M.: Asynchronous implementation of failure detectors. In: Proc. International IEEE Conference on Dependable Systems and Networks (DSN\u201903), pp. 351\u2013360. IEEE Society Press, Los Alamitos (2003)"},{"issue":"1","key":"9190_CR26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/S0129626401000452","volume":"11","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui, A., Raynal, M.: Leader-based consensus. Parallel Process. Lett. 11(1), 95\u2013107 (2001)","journal-title":"Parallel Process. Lett."},{"issue":"2","key":"9190_CR27","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1142\/S0129626406002575","volume":"16","author":"A. Most\u00e9faoui","year":"2006","unstructured":"Most\u00e9faoui, A., Mourgaya, E., Raynal, M., Travers, C.: Time-free assumption to implement eventual leadership. Parallel Process. Lett. 16(2), 189\u2013208 (2006)","journal-title":"Parallel Process. Lett."},{"issue":"7","key":"9190_CR28","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/TPDS.2006.95","volume":"17","author":"A. Most\u00e9faoui","year":"2006","unstructured":"Most\u00e9faoui, A., Raynal, M., Travers, C.: Time-free and timeliness assumptions can be combined to get eventual leadership. IEEE Trans. Parallel Distrib. Syst. 17(7), 656\u2013666 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9190_CR29","first-page":"386","volume-title":"Proc. of the 22nd International Symposium on Fault-Tolerant Computing (FTCS-22)","author":"D. Powell","year":"1992","unstructured":"Powell, D.: Failure mode assumptions and assumption coverage. In: Proc. of the 22nd International Symposium on Fault-Tolerant Computing (FTCS-22), pp. 386\u2013395. IEEE Computer Society Press, Boston (1992)"},{"issue":"1","key":"9190_CR30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/1052796.1052806","volume":"36","author":"M. Raynal","year":"2005","unstructured":"Raynal, M.: A short introduction to failure detectors for asynchronous distributed systems. ACM SIGACT News, Distrib. Comput. Column 36(1), 53\u201370 (2005)","journal-title":"ACM SIGACT News, Distrib. Comput. Column"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9190-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9190-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T20:59:41Z","timestamp":1684357181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9190-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,19]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9190"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9190-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,19]]}}}