{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:15:59Z","timestamp":1725574559369},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201847"},{"type":"electronic","value":"9783540399896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_25","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T02:01:57Z","timestamp":1294452117000},"page":"352-366","source":"Crossref","is-referenced-by-count":4,"title":["Overcoming the Majority Barrier in Large-Scale Systems"],"prefix":"10.1007","author":[{"given":"Haifeng","family":"Yu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient Overlay Networks. In: Proceedings of the 18th Symposium on Operating Systems Principles (SOSP) (October 2001)","DOI":"10.1145\/502034.502048"},{"issue":"3","key":"25_CR2","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"},{"issue":"5","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1137\/S0097539792240881","volume":"25","author":"J. Aspnes","year":"1996","unstructured":"Aspnes, J., Waarts, O.: Randomized Consensus in Expected O(nlog 2 n) Operations per Processor. SIAM Journal on Computing\u00a025(5), 1024\u20131044 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message-Passing Systems. Journal of the ACM, 124\u2013142 (January 1996)","DOI":"10.1145\/200836.200869"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/174644.174649","volume":"41","author":"H. Attiya","year":"1994","unstructured":"Attiya, H., Dwork, C., Lynch, N., Stockmeyer, L.: Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. Journal of the ACM\u00a041(1), 122\u2013152 (1994)","journal-title":"Journal of the ACM"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Barbara, D., Garcia-Molina, H.: The Vulnerability of Vote Assignments. ACM Transactions on Computer Systems (August 1986)","DOI":"10.1145\/6420.6421"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In: Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bracha, G., Toueg, S.: Asynchronous Consensus and Broadcast Protocols. Journal of the ACM, 824\u2013840 (October 1985)","DOI":"10.1145\/4221.214134"},{"key":"25_CR9","unstructured":"Chandra, B., Dahlin, M., Gao, L., Nayate, A.: End-to-End WAN Service Availability. In: Proceedings of the 3rd Usenix Symposium on Internet Technologies and Systems (January 2001)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 225\u2013267 (March 1996)","DOI":"10.1145\/226643.226647"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Chor, B., Israeli, A., Li, M.: On Processor Coordination Using Asynchronous Hardware. In: Symposium on Principles of Distributed Computing, pp. 86\u201397 (1987)","DOI":"10.1145\/41840.41848"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, R., Erez, K., ben Avraham, D., Havlin, S.: Resilience of the Internet to Random Breakdowns. Physical Review Letters\u00a085(21) (November 2000)","DOI":"10.1103\/PhysRevLett.85.4626"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1990)","journal-title":"Journal of the ACM"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Englert, B., Shvartsman, A.A.: Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory. In: Proceedings of the International Conference on Distributed Computer Systems, pp. 454\u2013463 (2000)","DOI":"10.1109\/ICDCS.2000.840958"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Gafni, E., Lamport, L.: Disk Paxos. In: Proceedings of the International Symposium on Distributed Computing, pp. 330\u2013344 (2000)","DOI":"10.1007\/3-540-40026-5_22"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-40026-5_6","volume-title":"Distributed Computing","author":"I. Gupta","year":"2000","unstructured":"Gupta, I., Renesse, R.V., Birman, K.: A Probabilistically Correct Leader Election Protocol for Large Groups. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, p. 89. Springer, Heidelberg (2000)"},{"issue":"8","key":"25_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/2.781631","volume":"32","author":"J. Hennessy","year":"1999","unstructured":"Hennessy, J.: The Future of Systems Research. IEEE Computer\u00a032(8), 27\u201333 (1999)","journal-title":"IEEE Computer"},{"key":"25_CR19","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, 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Lee, E.K., Thekkath, C.A.: Petal: Distributed Virtual Disks. In: Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems (October 1996)","DOI":"10.1145\/237090.237157"},{"key":"25_CR21","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1997","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1997)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_12","volume-title":"Distributed Computing","author":"N. Lynch","year":"2002","unstructured":"Lynch, N., Shvartsman, A.: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, Springer, Heidelberg (2002)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic Quorum Systems. The Information and Computation Journal\u00a0170(2) (November 2001)","DOI":"10.1006\/inco.2001.3054"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Raynal, M.: Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus. In: Proceedings of the 19th International Conference on Foundations of Software Technology and Theoretical Computer Science (December 1999)","DOI":"10.1007\/3-540-46691-6_26"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Muthitacharoen, A., Morris, R., Gil, T., Chen, B.: Ivy: A Read\/Write Peer-to-peer File System. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation (December 2002)","DOI":"10.1145\/1060289.1060293"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Peleg, D., Wool, A.: The Availability of Quorum Systems. In: Information and Computation, pp. 210\u2013223 (1995)","DOI":"10.1006\/inco.1995.1169"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In: Proceedings of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware 2001) (November 2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"25_CR28","unstructured":"Saks, M., Shavit, N., Woll, H.: Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. In: Proceedings of the Second Symposium on Discrete Algorithms, January 1991, pp. 351\u2013362 (1991)"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Savage, S., Anderson, T., Aggarwal, A., Becker, D., Cardwell, N., Collins, A., Hoffman, E., Snell, J., Vahdat, A., Voelker, G., Zahorjan, J.: Detour: A Case for Informed Internet Routing and Transport. IEEE Micro\u00a019(1) (January 1999)","DOI":"10.1109\/40.748796"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings ofthe ACM SIGCOMM 2001, August 2001, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"key":"25_CR31","unstructured":"Yu, H.: Overcoming the Majority Barrier in Large-Scale Systems. Technical report, Duke University (2003), Technical Report CS-2003-05, Available at http:\/\/www.cs.duke.edu\/~yhf\/tr-2003-05.pdf."},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Yu, H., Vahdat, A.: The Costs and Limits of Availability for Replicated Services. In: Proceedings ofthe 18th ACM Symposium on Operating Systems Principles (SOSP) (October 2001)","DOI":"10.1145\/502034.502038"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39989-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:03:05Z","timestamp":1559930585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}