{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T14:40:01Z","timestamp":1737124801712,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009122"},{"type":"electronic","value":"9783540377955"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/3-540-37795-6_7","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T21:20:40Z","timestamp":1182720040000},"page":"35-39","source":"Crossref","is-referenced-by-count":5,"title":["Open Questions on Consensus Performance inWell-Behaved Runs"],"prefix":"10.1007","author":[{"given":"Idit","family":"Keidar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1006\/inco.1996.0034","volume":"126","author":"R. Alur","year":"1996","unstructured":"R. Alur and G. Taubenfeld. Contention-free complexity of shared memory algorithms. Inform. Comput., 126(1):62\u201373, 1996.","journal-title":"Inform. Comput."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/174644.174649","volume":"41","author":"H. Attiya","year":"1994","unstructured":"H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. J. ACM, 41(1):122\u2013152, 1994.","journal-title":"J. ACM"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"O. Bakr and I. Keidar. Evaluating the running time of a communication round over the Internet. In ACM Symp. on Prin. of Dist. Comp. (PODC), pp. 243\u2013252, July 2002.","DOI":"10.1145\/571825.571864"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/128738.128742","volume":"9","author":"K. Birman","year":"1991","unstructured":"K. Birman, A. Schiper, and P. Stephenson. Lightweight causal and atomic group multicast. ACM Trans. Comp. Sys., 9(3):272\u2013314, 1991.","journal-title":"ACM Trans. Comp. Sys."},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685\u2013722, 1996.","journal-title":"J. ACM"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225\u2013267, March 1996.","journal-title":"J. ACM"},{"key":"7_CR7","unstructured":"B. Charron-Bost and A. Schiper. Uniform consensus is harder than consensus (extended abstract). Tech Rep DSC\/2000\/028, EPFL, Switzerland, May 2000. Submitted to J. Algorithms."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In 21st ACM Symp. on Prin. of Dist. Comp. (PODC), Jul 2002.","DOI":"10.1145\/571825.571837"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/503112.503113","volume":"33","author":"G.V. Chockler","year":"2001","unstructured":"G.V. Chockler, I. Keidar, and R. Vitenberg. Group Communication Specifications:A Comprehensive Study. ACM Comp. Surveys, 33(4):1\u201343, December 2001.","journal-title":"ACM Comp. Surveys"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE Trans. Par. Dist. Sys., pages 642\u2013657, June 1999.","DOI":"10.1109\/71.774912"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"P. Dutta and E. Guerraoui. The inherent price of indulgence. In 21st ACM Symp. on Prin. of Dist. Comp. (PODC), July 2002.","DOI":"10.1145\/571825.571838"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2):288\u2013323, Apr 1988.","journal-title":"J. ACM"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32:374\u2013382, Apr 1985.","DOI":"10.1145\/3149.214121"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"E. Gafni and L. Lamport. Disk paxos. In Int\u2019l Symp. on DISt. Comp. (DISC), pp. 330\u2013344, 2000.","DOI":"10.1007\/3-540-40026-5_22"},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0022140","volume-title":"Int\u2019l Wshop on Dist. Alg. (WDAG)","author":"R. Guerraoui","year":"1995","unstructured":"R. Guerraoui. Revisiting the relationship between non-blocking atomic commitment and consensus. In Int\u2019l Wshop on Dist. Alg. (WDAG), pp. 87\u2013100. Sep 1995. LNCS972."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"R. Guerraoui. Indulgent Algorithms. In 19th ACM Symp. on Prin. of Dist. Comp. (PODC), pp. 289\u2013297. 2000.","DOI":"10.1145\/343477.343630"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"M. Hurfin and M. Raynal. A simple and fast asynchronous consensus protocol based on a weak failure detector. Dist. Comp., 12(4), 1999.","DOI":"10.1007\/s004460050067"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"R. Jimenez-Peris, M. Patino-Martinez, G. Alonso, and S. Arevalo. A low latency nonblocking commit protocol. In Int\u2019l Symp. on DISt. Comp. (DISC), Oct 2001.","DOI":"10.1007\/3-540-45414-4_7"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"I. Keidar and S. Rajsbaum. A simple proof of the uniform consensus synchronous lower bound. Information Processing Letters, 2002. To appear.","DOI":"10.1016\/S0020-0190(02)00333-2"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"L. Lamport. The part-time parliament. ACMTrans. Comp. Sys., 16(2):133\u2013169, May 1998.","DOI":"10.1145\/279227.279229"},{"key":"7_CR21","unstructured":"L. Lamport and M. Fischer. Byzantine generals and transaction commit protocols. Tech Rep 62, SRI Int\u2019l, Apr 1982."},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/S0097539799364006","volume":"31","author":"Y. Moses","year":"2002","unstructured":"Y. Moses and S. Rajsbaum. A layered analysis of consensus. SIAM J. Comp., 31(4):989\u20131021, 2002.","journal-title":"SIAM J. Comp."},{"issue":"9","key":"7_CR23","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/71.308532","volume":"5","author":"S. Rajsbaum","year":"1994","unstructured":"S. Rajsbaum and M. Sidi. On the performance of synchronized programs in distributed networks with random processing times and transmission delays. IEEE Trans. Par. Dist. Sys., 5(9):939\u2013950, 1994.","journal-title":"IEEE Trans. Par. Dist. Sys."},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s004460050032","volume":"10","author":"A. Schiper","year":"1997","unstructured":"A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Dist. Comp., 10(3):149\u2013157, 1997.","journal-title":"Dist. Comp."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"D. Skeen. Nonblocking commit protocols. In ACM SIGMOD Int\u2019l Symp. on Management of Data, pp. 133\u2013142, 1981.","DOI":"10.1145\/582318.582339"}],"container-title":["Lecture Notes in Computer Science","Future Directions in Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37795-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T13:58:48Z","timestamp":1737122328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37795-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009122","9783540377955"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-37795-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}