{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:06Z","timestamp":1759637766437},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662486528"},{"type":"electronic","value":"9783662486535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48653-5_14","type":"book-chapter","created":{"date-parts":[[2015,10,2]],"date-time":"2015-10-02T18:46:01Z","timestamp":1443811561000},"page":"200-214","source":"Crossref","is-referenced-by-count":4,"title":["Why Non-blocking Operations Should be Selfish"],"prefix":"10.1007","author":[{"given":"Joel","family":"Gibson","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,5]]},"reference":[{"issue":"1","key":"14_CR1","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. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Petrank, E., Timnat, S.: Help! In: PODC, pp. 241\u2013250 (2015)","DOI":"10.1145\/2767386.2767415"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Gramoli, V.: More than you ever wanted to know about synchronization: Synchrobench, measuring the impact of the synchronization on concurrent algorithms. In: PPoPP, pp. 1\u201310 (2015)","DOI":"10.1145\/2858788.2688501"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: PODC, pp. 50\u201359 (2004)","DOI":"10.1145\/1011767.1011776"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Oshman, R., Shavit, N.: The SkipTrie: low-depth concurrent search without rebalancing. In: PODC, pp. 23\u201332 (2013)","DOI":"10.1145\/2484239.2484270"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, B., Nguyen, N., Tsigas, P.: Efficient lock-free binary search trees. In: PODC, pp. 322\u2013331 (2014)","DOI":"10.1145\/2611462.2611500"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Helga, J., Ruppert, E.: The amortized complexity of non-blocking binary search trees. In: PODC, pp. 332\u2013340 (2014)","DOI":"10.1145\/2611462.2611486"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s004460100060","volume":"15","author":"Y Afek","year":"2002","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive splitter and applications. Distributed Computing 15(2), 67\u201386 (2002)","journal-title":"Distributed Computing"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"David, T., Guerraoui, R., Trigonakis, V.: Asynchronized concurrency: the secret to scaling concurrent search data structures. In: ASPLOS, pp. 631\u2013644 (2015)","DOI":"10.1145\/2775054.2694359"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11795490_3","volume-title":"Principles of Distributed Systems","author":"S Heller","year":"2006","unstructured":"Heller, S., Herlihy, M.P., Luchangco, V., Moir, M., Scherer III, W.N., Shavit, N.N.: A lazy concurrent list-based set algorithm. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 3\u201316. Springer, Heidelberg (2006)"},{"key":"14_CR12","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73\u201382 (2002)","DOI":"10.1145\/564870.564881"},{"issue":"6","key":"14_CR14","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1145\/268999.269000","volume":"44","author":"C Dwork","year":"1997","unstructured":"Dwork, C., Herlihy, M., Waarts, O.: Contention in shared memory algorithms. J. ACM 44(6), 779\u2013805 (1997)","journal-title":"J. ACM"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11561927_11","volume-title":"Distributed Computing","author":"H Attiya","year":"2005","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 122\u2013136. Springer, Heidelberg (2005)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Hendler, D.: Non-blocking algorithms. In: Encyclopedia of Parallel Computing. Springer, pp. 1321\u20131329 (2011)","DOI":"10.1007\/978-0-387-09766-4_185"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-04355-0_17","volume-title":"Distributed Computing","author":"G Taubenfeld","year":"2009","unstructured":"Taubenfeld, G.: Contention-sensitive data structures and algorithms. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 157\u2013171. Springer, Heidelberg (2009)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A speculation-friendly binary search tree. In: PPoPP, pp. 161\u2013170 (2012)","DOI":"10.1145\/2370036.2145837"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-40047-6_25","volume-title":"Euro-Par 2013 Parallel Processing","author":"T Crain","year":"2013","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A contention-friendly binary search tree. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 229\u2013240. Springer, Heidelberg (2013)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Brown, T., Ellen, F., Ruppert, E.: A general technique for non-blocking trees. In: PPoPP, pp. 329\u2013342 (2014)","DOI":"10.1145\/2692916.2555267"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: No hot spot non-blocking skip list. In: ICDCS, pp. 196\u2013205 (2013)","DOI":"10.1109\/ICDCS.2013.42"},{"key":"14_CR22","unstructured":"Dick, I., Fekete, A., Gramoli, V.: Logarithmic data structures for multicores. Technical Report 697, University of Sydney (2014)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Valois, J.D.: Lock-free linked lists using compare-and-swap. In: PODC, pp. 214\u2013222 (1995)","DOI":"10.1145\/224964.224988"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"14_CR25","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S., Shang, D.: Brief announcement: a concurrency-optimal list-based set. In: DISC. LNCS (2015)"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-25873-2_22","volume-title":"Principles of Distributed Systems","author":"M Herlihy","year":"2011","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 313\u2013328. Springer, Heidelberg (2011)"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Censor-Hillel, K., Shavit, N.: Are lock-free concurrent algorithms practically wait-free? In: STOC, pp. 714\u2013723 (2014)","DOI":"10.1145\/2591796.2591836"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Kogan, A., Petrank, E.: A methodology for creating fast wait-free data structures. In: PPoPP, pp. 141\u2013150 (2012)","DOI":"10.1145\/2370036.2145835"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Timnat, S., Petrank, E.: A practical wait-free simulation for lock-free data structures. In: PPoPP, pp. 357\u2013368 (2014)","DOI":"10.1145\/2692916.2555261"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48653-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:31:33Z","timestamp":1559259093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48653-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662486528","9783662486535"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48653-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}