{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:56Z","timestamp":1725488096370},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426059"},{"type":"electronic","value":"9783540454144"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45414-4_11","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T15:12:40Z","timestamp":1184944360000},"page":"151-165","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Synchronous Iterative Do-All with Crashes"],"prefix":"10.1007","author":[{"given":"Chryssis","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"11_CR1","unstructured":"Aumann, Y., Rabin, M.O.: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. 33rd IEEE Symp. on Foundations of Computer Science (1993) 147\u2013156."},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/S0097539794319126","volume":"26","author":"R.J. Anderson","year":"1997","unstructured":"Anderson, R.J., Woll, H.: Algorithms for the Certified Write All Problem. SIAM Journal of Computing, Vol. 26 5 (1997) 1277\u20131283.","journal-title":"SIAM Journal of Computing"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/jagm.1996.0003","volume":"20","author":"J. Buss","year":"1996","unstructured":"Buss, J., Kanellakis, P.C., Ragde, P., Shvartsman, A.A.: Parallel Algorithms with Processor Failures and Delays. Journal of Algorithms, Vol. 20 (1996) 45\u201386.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/PL00008926","volume":"14","author":"B.S. Chlebus De","year":"2001","unstructured":"Chlebus, B.S., De Prisco, R., Shvartsman, A.A: Performing Tasks on Restartable Message-Passing Processors. Distributed Computing, Vol. 14 1 (2001) 49\u201364.","journal-title":"Distributed Computing"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta, P., Kedem, Z., Rabin, M.: Parallel Processing on Networks of Workstation: A Fault-Tolerant, High Performance Approach. International Conference on Distributed Computer Systems (1995) 467\u2013474.","DOI":"10.1109\/ICDCS.1995.500052"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"De Prisco, R., Mayer, A., Yung, M.: Time-Optimal Message-Efficient Work Performance in the Presence of Faults. 13th ACM Symposium on Principles of Distributed Computing (1994) 161\u2013172.","DOI":"10.1145\/197917.198082"},{"key":"11_CR7","unstructured":"Dolev, S., Segala, R., Shvartsman, A.: Dynamic Load Balancing with Group Communication. 6th International Colloquium on Structural Information and Communication Complexity (1999) 111\u2013125."},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Halpern, J., Waarts, O.: Performing Work Efficiently in the Presence of Faults. SIAM J. on Computing, Vol. 27 5 (1998) 1457\u20131491.","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"11_CR9","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., Paterson, M.S.: Impossibility of Distributed Consensus with one Faulty Process. Journal of the ACM, Vol. 32 2 (1985) 374\u2013382.","journal-title":"Journal of the ACM"},{"key":"11_CR10","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving Message Complexity of Byzantine Agreement and Beyond. 36th IEEE Symp. on Foundations of Comp. Sc. (1995) 724\u2013733."},{"key":"11_CR11","unstructured":"Georgiou, C., Shvartsman, A.: Cooperative Computing with Fragmentable and Mergeable Groups. 7th International Colloquium on Structural Information and Communication Complexity (2000) 141\u2013156."},{"key":"11_CR12","unstructured":"Georgiou, C., Russell, A., Shvartsman, A.: The Complexity of Distributed Cooperation in the Presence of Failures. 4th International Conference on Principles of Distributed Systems (2000) 245\u2013264."},{"key":"11_CR13","unstructured":"Georgiou, C., Russell, A., Shvartsman, A.: The Complexity of Synchronous Iterative Do-All with Crashes. \n                  http:\/\/www.engr.uconn.edu\/~acr\/Papers\/faults.ps\n                  \n                ."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Hesselink, W.H., Mauw, S., Vermeulen, R.: An Algorithm for the Asynchronous Write-All Problem Based on Process Collision. Distributed Computing (2001).","DOI":"10.1007\/PL00008930"},{"key":"11_CR15","unstructured":"Hadzilacos, V., Toueg, S.: Fault-Tolerant Broadcasts and Related Problems. Distributed Computing, 2nd Ed., Addison-Wesley and ACM Press (1993)."},{"key":"11_CR16","series-title":"Technical report SEN-R9811","volume-title":"Waitfree Distributed Memory Management by Create, and Read Until Deletion (CRUD)","author":"W.H. Hesselink","year":"1998","unstructured":"Hesselink, W.H., Groote, J.F.: Waitfree Distributed Memory Management by Create, and Read Until Deletion (CRUD). Technical report SEN-R9811, CWI, Amsterdam (1998)."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Efficient Parallel Algorithms Can Be Made Robust. Distributed Computing, Vol. 5 (1992) 201\u2013217.","journal-title":"Distributed Computing"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Fault-Tolerant Parallel Computation. Kluwer Academic Publishers (1997) ISBN 0-7923-9922-6.","DOI":"10.1007\/978-1-4757-5210-6"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Kedem, Z.M., Palem, K.V., Raghunathan, A., Spirakis, P.: Combining Tentative and Definite Executions for Dependable Parallel Computing. 23d ACM Symposium on Theory of Computing (1991) 381\u2013390.","DOI":"10.1145\/103418.103459"},{"key":"11_CR20","unstructured":"Kedem, Z.M., Palem, K.V., Rabin, M.O., Raghunathan, A.: Efficient Program Transformations for Resilient Parallel Computation via Randomization. 24th ACM Symp. on Theory of Computing (1992) 306\u2013318."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Kedem, Z.M., Palem, K.V., Spirakis, P.: Efficient Robust Parallel Computations. 22nd ACM Symp. on Theory of Computing (1990) 138\u2013148.","DOI":"10.1145\/100216.100231"},{"key":"11_CR22","unstructured":"Lamport, L., Lynch, N.A.: Distributed Computing: Models and Methods. Handbook of Theoretical Computer Science, Vol. 1, North-Holland (1990)."},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM TOPLAS, Vol. 4 3 (1982) 382\u2013401.","journal-title":"ACM TOPLAS"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Malewicz, G.G., Russell A., Shvartsman, A.A.: Distributed Cooperation in the Absence of Communication. 14th International Symposium on Distributed Computing (2000) 119\u2013133.","DOI":"10.1007\/3-540-40026-5_8"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1006\/jagm.1994.1017","volume":"16","author":"C. Martel","year":"1994","unstructured":"Martel, C., Subramonian, R.: On the Complexity of CertifiedWrite-All Algorithms. Journal of Algorithms, Vol. 16 3 (1994) 361\u2013387.","journal-title":"Journal of Algorithms"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1137\/0221063","volume":"21","author":"C. Martel","year":"1992","unstructured":"Martel, C., Park, A., Subramonian, R.: Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM Journal on Computing, Vol. 21 (1992) 1070\u20131099.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Martel, C., Subramonian, R., Park, A.: Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs. 32d IEEE Symp. on Foundations of Computer Science (1990) 590\u2013599.","DOI":"10.1109\/FSCS.1990.89580"},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. Journal of the ACM, Vol. 27 2 (1980) 228\u2013234.","journal-title":"Journal of the ACM"},{"issue":"2","key":"11_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(91)90156-C","volume":"39","author":"A.A. Shvartsman","year":"1991","unstructured":"Shvartsman, A.A.: Achieving Optimal CRCW PRAM Fault-Tolerance. Information Processing Letters, Vol. 39 2 (1991) 59\u201366.","journal-title":"Information Processing Letters"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/357369.357371","volume":"3","author":"R.D. Schlichting","year":"1983","unstructured":"Schlichting, R.D, Schneider, F.B.: Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems. TOCS 1, Vol. 3 (1983) 222\u2013238.","journal-title":"TOCS"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45414-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:34:02Z","timestamp":1550450042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45414-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426059","9783540454144"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45414-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}