{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:11:53Z","timestamp":1725570713014},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"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_24","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"318-332","source":"Crossref","is-referenced-by-count":2,"title":["An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects"],"prefix":"10.1007","author":[{"given":"Danny","family":"Hendler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erez","family":"Michalak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"348","volume":"23","author":"J. Aspnes","year":"1991","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. STOC\u00a023, 348\u2013358 (1991)","journal-title":"STOC"},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/277697.277753","volume":"17","author":"T.D. Chandra","year":"1998","unstructured":"Chandra, T.D., Jayanti, P., Tan, K.: A Polylog Time Wait-Free Construction for Closed Objects. PODC\u00a017, 287\u2013296 (1998)","journal-title":"PODC"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the Minimal Synchronism Needed for Distributed Consensus. JACM\u00a034, 77\u201397 (1987)","journal-title":"JACM"},{"key":"24_CR4","first-page":"174","volume":"25","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Herlihy, M., Waarts, O.: Contention in shared memory algorithms. STOC\u00a025, 174\u2013183 (1993)","journal-title":"STOC"},{"key":"24_CR5","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. JACM\u00a035, 288\u2013323 (1988)","journal-title":"JACM"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1281100.1281106","volume":"26","author":"F. Ellen","year":"2007","unstructured":"Ellen, F., Lev, Y., Luchangco, V., Moir, M.: SNZI: scalable NonZero indicators. PODC\u00a026, 13\u201322 (2007)","journal-title":"PODC"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/70082.68188","volume":"3","author":"J.R. Goodman","year":"1989","unstructured":"Goodman, J.R., Vernon, M.K., Woest, P.J.: Efficient Synchronization Primitives for Large-Scale Cache-Coherent Multiprocessors. ASPLOS\u00a03, 64\u201375 (1989)","journal-title":"ASPLOS"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/285930.285983","volume":"9","author":"A. Gottlieb","year":"1998","unstructured":"Gottlieb, A., Grishman, R., Kruskal, C.P., McAuliffe, K.P., Rudolph, L., Snir, M.: The NYU ultracomputer - designing a MIMD, shared-memory parallel machine. ISCA\u00a09, 239\u2013254 (1998)","journal-title":"ISCA"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/74850.74870","volume":"12","author":"C. Gray","year":"1989","unstructured":"Gray, C., Cheriton, D.: Leases: an efficient fault-tolerant mechanism for distributed file cache consistency. SOSP\u00a012, 202\u2013210 (1989)","journal-title":"SOSP"},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/571825.571874","volume":"21","author":"M. Greenwald","year":"2002","unstructured":"Greenwald, M.: Two-Handed Emulation: How to build Non-Blocking implementations of Complex Data-Structures using DCAS. PODC\u00a021, 260\u2013269 (2002)","journal-title":"PODC"},{"key":"24_CR11","first-page":"213","volume":"8","author":"P.H. Ha","year":"2004","unstructured":"Ha, P.H., Papatriantafilou, M., Tsigas, P.: Self-tuning Reactive Distributed Trees for Counting and Balancing. OPODIS\u00a08, 213\u2013228 (2004)","journal-title":"OPODIS"},{"key":"24_CR12","first-page":"428","volume":"20","author":"D. Hendler","year":"2006","unstructured":"Hendler, D., Kutten, S.: Constructing shared objects that are both robust and high-throughput. DISC\u00a020, 428\u2013442 (2006)","journal-title":"DISC"},{"doi-asserted-by":"crossref","unstructured":"Hendler, D., Kutten, S., Michalak, E.: An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects - Technical Report, http:\/\/ie.technion.ac.il\/~kutten\/hkm2010.pdf","key":"24_CR13","DOI":"10.1007\/978-3-642-17653-1_24"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/1007912.1007944","volume":"16","author":"D. Hendler","year":"2004","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. SPAA\u00a016, 206\u2013215 (2004)","journal-title":"SPAA"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. TOPLAS\u00a013, 124\u2013149 (1991)","journal-title":"TOPLAS"},{"key":"24_CR16","first-page":"526","volume":"32","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M., Shavit, N., Waarts, O.: Linearizable Counting Networks. FOCS\u00a032, 526\u2013535 (1991)","journal-title":"FOCS"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS\u00a012, 463\u2013492 (1990)","journal-title":"TOPLAS"},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/1073970.1074013","volume":"17","author":"M. Moir","year":"2005","unstructured":"Moir, M., Nussbaum, D., Shalev, O., Shavit, N.: Using elimination to implement scalable and lock-free FIFO queues. SPAA\u00a017, 253\u2013262 (2005)","journal-title":"SPAA"},{"key":"24_CR19","first-page":"167","volume":"6","author":"N. Shavit","year":"1994","unstructured":"Shavit, N., Zemach, A.: Diffracting trees. SPAA\u00a06, 167\u2013176 (1994)","journal-title":"SPAA"}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T20:24:26Z","timestamp":1712003066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}