{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:47:57Z","timestamp":1725565677726},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226673"},{"type":"electronic","value":"9783540278603"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27860-3_20","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T21:38:30Z","timestamp":1284586710000},"page":"210-222","source":"Crossref","is-referenced-by-count":1,"title":["Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems"],"prefix":"10.1007","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariam","family":"Momenzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"20_CR1","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\u00a026(5), 1277\u20131283 (1997)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1996","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message Passing Systems. Journal of the ACM\u00a042(1), 124\u2013142 (1996)","journal-title":"Journal of the ACM"},{"issue":"1","key":"20_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., Ragde, P., Shvartsman, A.: Parallel Algorithms with Processor Failures and Delays. Jour. of Algorithms\u00a020(1), 45\u201386 (1996)","journal-title":"Jour. of Algorithms"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-36108-1_20","volume-title":"Distributed Computing","author":"B.S. Chlebus","year":"2002","unstructured":"Chlebus, B.S., Ga\u0327sieniec, L., Kowalski, D., Shvartsman, A.A.: Boundingwork and communication in robust cooperative computation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 295\u2013310. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"De Prisco, R., Mayer, A., Yung, M.: Time-Optimal Message-EfficientWork Performance in the Presents of Faults. In: Proceedings of the 13th Symposium on Distributed Computing, pp. 161\u2013172 (1994)","key":"20_CR5","DOI":"10.1145\/197917.198082"},{"issue":"5","key":"20_CR6","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 Efficiency in Presence of Faults. SIAM Journal on Computing\u00a027(5), 1457\u20131491 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","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. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving Message Complexity of Byzantine Agreement and Beyond. In: Proceedings of the 36th IEEE Symposium on Foundation of Computer Science, pp. 724\u2013733 (1995)","key":"20_CR8","DOI":"10.1109\/SFCS.1995.492674"},{"doi-asserted-by":"crossref","unstructured":"Georgiou, C., Kowalski, D., Shvartsman, A.A.: Efficient Gossip and Robust Distributed Computation. In: Proc. of the 17th International Symposium on Distributed Computing, pp. 224\u2013238 (2003)","key":"20_CR9","DOI":"10.1007\/978-3-540-39989-6_16"},{"doi-asserted-by":"crossref","unstructured":"Gifford, D.K.: Weighted Voting for Replicated Data. In: Proceedings of the 7th Symposium on Operating Systems Principles, pp. 150\u2013159 (1979)","key":"20_CR10","DOI":"10.1145\/800215.806583"},{"key":"20_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5210-6","volume-title":"Fault-Tolerant Parallel Computation","author":"P.C. Kanellakis","year":"1997","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Fault-Tolerant Parallel Computation. Kluwer Academic Publishers, Dordrecht (1997) ISBN 0-7923-9922-6"},{"doi-asserted-by":"crossref","unstructured":"Kedem, Z.M., Palem, K.V., Raghunathan, A., Spirakis, P.: Combing Tentative and Definite Executions for Dependable Parallel Computing. In: Proceedings of the 23rd Symposium on Theory of Computing, pp. 381\u2013390 (1991)","key":"20_CR12","DOI":"10.1145\/103418.103459"},{"doi-asserted-by":"crossref","unstructured":"Kowalski, D., Shvartsman, A.A.: Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds. In: Proceedings 22nd ACM Symposium on Distributed Computing, pp. 211\u2013222 (2003)","key":"20_CR13","DOI":"10.1145\/872035.872076"},{"doi-asserted-by":"crossref","unstructured":"Lynch, N., Shvartsman, A.A.: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In: Proceedings of the 16th International Symposium on Distributed Computing (DISC), pp. 173\u2013190 (2002)","key":"20_CR14","DOI":"10.1007\/3-540-36108-1_12"},{"unstructured":"Momenzadeh, M.: Emulating Shared-Memory Do-All in Asynchronous Message Passing Systems, Masters thesis, University of Connecticut (2003)","key":"20_CR15"},{"issue":"2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/320071.320076","volume":"4","author":"R. Thomas","year":"1979","unstructured":"Thomas, R.: A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. on Database Sys.\u00a04(2), 180\u2013209 (1979)","journal-title":"ACM Trans. on Database Sys."}],"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-540-27860-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:29Z","timestamp":1605759869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27860-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226673","9783540278603"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27860-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}