{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T04:30:00Z","timestamp":1791174600570,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176524","type":"print"},{"value":"9783642176531","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_17","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T00:50:47Z","timestamp":1291596647000},"page":"205-218","source":"Crossref","is-referenced-by-count":24,"title":["Distributed Programming with Tasks"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. J. ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"3-4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A Simple Bivalency Proof that t-Resilient Consensus Requires t\u2009+\u20091 Rounds. Inf. Process. Lett.\u00a071(3-4), 155\u2013158 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message-Passing Systems. J. ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an Asynchronous Environment. J. ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/11947950_36","volume-title":"Distributed Computing and Networking","author":"Y. Afek","year":"2006","unstructured":"Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol.\u00a04308, pp. 331\u2013334. Springer, Heidelberg (2006)"},{"key":"17_CR6","unstructured":"Baldoni, R., Raynal, M.: Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems. IEEE Distributed Systems Online 3(2) (2002)"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O. Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms\u00a011(3), 420\u2013440 (1990)","journal-title":"J. Algorithms"},{"key":"17_CR8","first-page":"91","volume-title":"Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press, New York (1993)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/259380.259439","volume-title":"Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997)","author":"E. Borowsky","year":"1997","unstructured":"Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189\u2013198. ACM Press, New York (August 1997)"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"issue":"1","key":"17_CR11","first-page":"2","volume":"2","author":"H. Brit","year":"1996","unstructured":"Brit, H., Moran, S.: Wait-Freedom vs. Bounded-Freedom in Public Data Structures. J. UCS\u00a02(1), 2\u201319 (1996)","journal-title":"J. UCS"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/62546.62556","volume-title":"Proc. 7th ACM Symposium on Principles of Distributed Computing (PODC)","author":"C.-T. Chou","year":"1988","unstructured":"Chou, C.-T., Gafni, E.: Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. In: Proc. 7th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Ontario, Canada, August 15-17, pp. 44\u201365. ACM Press, New York (1988)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology upper and lower bounds for renaming. In: Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Canada, August 18-21, pp. 295\u2013304 (2008)","DOI":"10.1145\/1400751.1400791"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B. Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The Heard-Of model: computing in distributed systems with benign faults. Distributed Computing\u00a022(1), 49\u201371 (2009)","journal-title":"Distributed Computing"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S. Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation\u00a0105, 132\u2013158 (1993)","journal-title":"Information and Computation"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-04355-0_6","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The Disagreement Power of an Adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 8\u201321. Springer, Heidelberg (2009)"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Elrad, T., Francez, N.: Decomposition of Distributed Programs into Communication-Closed Layers. Sci. Comput. Program.\u00a02(3), 155\u2013173 (1982)","journal-title":"Sci. Comput. Program."},{"issue":"8","key":"17_CR18","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"C.J. Fidge","year":"1991","unstructured":"Fidge, C.J.: Logical Time in Distributed Computing Systems. IEEE Computer\u00a024(8), 28\u201333 (1991)","journal-title":"IEEE Computer"},{"issue":"2","key":"17_CR19","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\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). In: Proc. 17nth ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28-July 2, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-92221-6_17","volume-title":"Principles of Distributed Systems","author":"E. Gafni","year":"2008","unstructured":"Gafni, E.: The 0-1-Exclusion Families of Tasks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 246\u2013258. Springer, Heidelberg (2008)"},{"key":"17_CR22","first-page":"161","volume-title":"Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2001)","author":"E. Gafni","year":"2001","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The Concurrency Hierarchy, and Algorithms for Unbounded Concurrency. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 161\u2013169. ACM Press, New York (2001)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11561927_7","volume-title":"Distributed Computing","author":"E. Gafni","year":"2005","unstructured":"Gafni, E., Rajsbaum, S.: Musical Benches. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 63\u201377. Springer, Heidelberg (2005)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-16023-3_30","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"E. Gafni","year":"2010","unstructured":"Gafni, E., Rajsbaum, S.: Recursion in distributed computing. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 362\u2013376. Springer, Heidelberg (2010)"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11864219_23","volume-title":"Distributed Computing","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/11682462_47","volume-title":"LATIN 2006: Theoretical Informatics","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The Committee Decision Problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 502\u2013514. Springer, Heidelberg (2006)"},{"issue":"1","key":"17_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems\u00a011(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR28","volume-title":"Encyclopedia of Algorithms","author":"M. Herlihy","year":"2008","unstructured":"Herlihy, M.: Linearizability. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, Springer, Heidelberg (2008)"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The Topology of Shared-Memory Adversaries. In: Proc. of the 29th ACM Symposium on Principles of Distributed Computing (PODC), Zurich, Switzerland, July 25-28, pp. 105\u2013113 (2010)","DOI":"10.1145\/1835698.1835724"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-15763-9_10","volume-title":"DISC 2010","author":"M. Herlihy","year":"2010","unstructured":"Herlihy, M., Rajsbaum, S.: Concurrent Computing and Shellable Complexes. In: Lynch, N., Shvartsman, A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 109\u2013123. Springer, Heidelberg (2010)"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.R.: Unifying Synchronous and Asynchronous Message-Passing Models. In: Proc. 17nth ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28-July 2, pp. 133\u2013142 (1998)","DOI":"10.1145\/277697.277722"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: A simple constructive computability theorem for wait-free computation. In: Proc. 26th ACM Symposium on Theory of Computing (STOC), Montreal, Quebec, Canada, May 23-25, pp. 243\u2013252 (1994)","DOI":"10.1145\/195058.195144"},{"issue":"6","key":"17_CR33","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-37795-6_5","volume-title":"Future Directions in Distributed Computing","author":"F.P. Junqueira","year":"2003","unstructured":"Junqueira, F.P., Marzullo, K.: Designing Algorithms for Dependent Process Failures. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol.\u00a02584, pp. 24\u201328. Springer, Heidelberg (2003)"},{"issue":"7","key":"17_CR35","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. ACM Commun.\u00a021(7), 558\u2013565 (1978)","journal-title":"ACM Commun."},{"key":"17_CR36","first-page":"215","volume-title":"Proc. Parallel and Distributed Algorithms Conf.","author":"F. Mattern","year":"1988","unstructured":"Mattern, F.: Virtual Time and Global States of Distributed Systems. In: Proc. Parallel and Distributed Algorithms Conf., pp. 215\u2013226. Elsevier Science, Amsterdam (1988)"},{"issue":"4","key":"17_CR37","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/S0097539799364006","volume":"31","author":"Y. Moses","year":"2002","unstructured":"Moses, Y., Rajsbaum, S.: A Layered Analysis of Consensus. SIAM J. Comput.\u00a031(4), 989\u20131021 (2002)","journal-title":"SIAM J. Comput."},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-12200-2_36","volume-title":"Proc. of the 9th Latin American Symposium on Theoretical Informatics (LATIN 2010)","author":"S. Rajsbaum","year":"2010","unstructured":"Rajsbaum, S.: Iterated Shared Memory Models. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 407\u2013416. Springer, Heidelberg (2010)"},{"issue":"3","key":"17_CR39","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ipl.2008.05.001","volume":"108","author":"S. Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: An impossibility about failure detectors in the iterated immediate snapshot model. Inf. Process. Lett.\u00a0108(3), 160\u2013164 (2008)","journal-title":"Inf. Process. Lett."},{"key":"17_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-69733-6_48","volume-title":"Computing and Combinatorics","author":"S. Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The Iterated Restricted Immediate Snapshot Model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 487\u2013497. Springer, Heidelberg (2008)"},{"issue":"5","key":"17_CR41","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M.E. Saks","year":"2000","unstructured":"Saks, M.E., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Zielinski, P.: Anti-Omega: the weakest failure detector for set agreement. In: Bazzi, R.A., Patt-Shamir, B. (eds.) Proc. 27nth ACM Symp. Principles of Distributed Computing (PODC), Toronto, Canada, August 18-21, pp. 55\u201364 (2008)","DOI":"10.1145\/1400751.1400761"}],"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-642-17653-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T08:34:08Z","timestamp":1740731648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}