{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:34:34Z","timestamp":1725831274233},"publisher-location":"Berlin, Heidelberg","reference-count":46,"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_12","type":"book-chapter","created":{"date-parts":[[2015,10,2]],"date-time":"2015-10-02T18:46:01Z","timestamp":1443811561000},"page":"170-184","source":"Crossref","is-referenced-by-count":3,"title":["Towards Automatic Lock Removal for Scalable Synchronization"],"prefix":"10.1007","author":[{"given":"Maya","family":"Arbel","sequence":"first","affiliation":[]},{"given":"Guy","family":"Golan-Gueta","sequence":"additional","affiliation":[]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,5]]},"reference":[{"key":"12_CR1","unstructured":"Concurrentskiplistmap from java.util.concurrent. \n                    http:\/\/docs.oracle.com\/javase\/7\/docs\/api\/java\/util\/concurrent\/ConcurrentSkipListMap.html"},{"key":"12_CR2","unstructured":"A fast and lightweight key\/value database library by google. \n                    http:\/\/code.google.com\/p\/leveldb"},{"key":"12_CR3","unstructured":"jmonkeyengine: a 3d game engine for java developers. \n                    http:\/\/jmonkeyengine.org\/"},{"issue":"4","key":"12_CR4","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., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33651-5_1","volume-title":"Distributed Computing","author":"Y Afek","year":"2012","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: CBTree: a practical concurrent self-adjusting search tree. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 1\u201315. Springer, Heidelberg (2012)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Afek, Y., Levy, A., Morrison, A.: Software-improved hardware lock elision. In: PODC (2014)","DOI":"10.1145\/2611462.2611482"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Aragon, C.R., Seidel, R.: Randomized search trees. In: FOCS, pp. 540\u2013545 (1989)","DOI":"10.1109\/SFCS.1989.63531"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Arbel, M., Attiya, H.: Concurrent updates with RCU: search tree as an example. In: PODC, pp. 196\u2013205 (2014)","DOI":"10.1145\/2611462.2611471"},{"key":"12_CR9","unstructured":"Arbel, M., Golan-Gueta, G., Hillel, E., Keidar, I.: Towards automatic lock removal for scalable synchronization (full version). \n                    https:\/\/labs.yahoo.com\/publications\/8476\/towards-automatic-lock-removal- scalable-synchronization-full-version"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Braginsky, A., Petrank, E.: A lock-free B+tree. In: SPAA, pp. 58\u201367 (2012)","DOI":"10.1145\/2312005.2312016"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: PPOPP, pp. 257\u2013268 (2010)","DOI":"10.1145\/1837853.1693488"},{"key":"12_CR12","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"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1454456.1454466","volume":"6","author":"C Cascaval","year":"2008","unstructured":"Cascaval, C., Blundell, C., Michael, M., Cain, H.W., Wu, P., Chiras, S., Chatterjee, S.: Software transactional memory: Why is it only a research toy? Queue 6(5), 46\u201358 (2008)","journal-title":"Queue"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Cherem, S., Chilimbi, T., Gulwani, S.: Inferring locks for atomic sections. In: PLDI (2008)","DOI":"10.1145\/1375581.1375619"},{"key":"12_CR15","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":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-78791-4_19","volume-title":"Compiler Construction","author":"D Cunningham","year":"2008","unstructured":"Cunningham, D., Gudka, K., Eisenbach, S.: Keep off the grass: locking the right path for atomicity. In: Hendren, L. (ed.) CC 2008. LNCS, vol. 4959, pp. 276\u2013290. Springer, Heidelberg (2008)"},{"key":"12_CR17","unstructured":"Dice, D., Harris, T.L., Kogan, A., Lev, Y., Moir, M.: Hardware extensions to make lazy subscription safe (2014). CoRR, abs\/1407.6968"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11864219_14","volume-title":"Distributed Computing","author":"D Dice","year":"2006","unstructured":"Dice, D., Shalev, O., Shavit, N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Doherty, S., Detlefs, D.L., Groves, L., Flood, C.H., Luchangco, V., Martin, P.A., Moir, M., Shavit, N., Steele Jr, G.L.: Dcas is not a silver bullet for nonblocking algorithm design. In: SPAA (2004)","DOI":"10.1145\/1007912.1007945"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Drachsler, D., Vechev, M.T., Yahav, E.: Practical concurrent binary search trees via logical ordering. In: PPoPP, pp. 343\u2013356 (2014)","DOI":"10.1145\/2692916.2555269"},{"key":"12_CR21","unstructured":"Duffy, J.: A (brief) retrospective on transactional memory (2010). \n                    http:\/\/joeduffyblog.com\/2010\/01\/03\/a-brief-retrospective-on-transactional-memory"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., van Breugel, F.: Non-blocking binary search trees. In: PODC, pp. 131\u2013140 (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Emmi, M., Fischer, J.S., Jhala, R., Majumdar, R.: Lock allocation. In: POPL, pp. 291\u2013296 (2007)","DOI":"10.1145\/1190215.1190260"},{"key":"12_CR24","unstructured":"Felber, G.K., Shavit, P.N.: Deuce: noninvasive concurrency with a Java STM. In: MULTIPROG (2010)"},{"key":"12_CR25","unstructured":"Fraser, K.: Practical lock-freedom. Ph.D thesis, University of Cambridge (2004)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Golan-Gueta, G., Bronson, N.G., Aiken, A., Ramalingam, G., Sagiv, M., Yahav, E.: Automatic fine-grain locking using shape properties. In: OOPSLA, pp. 225\u2013242 (2011)","DOI":"10.1145\/2076021.2048086"},{"key":"12_CR27","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 (2015)","DOI":"10.1145\/2688500.2688501"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-31057-7_15","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming","author":"K Gudka","year":"2012","unstructured":"Gudka, K., Harris, T., Eisenbach, S.: Lock inference in the presence of large libraries. In: Noble, J. (ed.) ECOOP 2012. LNCS, vol. 7313, pp. 308\u2013332. Springer, Heidelberg (2012)"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPOPP, pp. 175\u2013184 (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Harris, T., Larus, J., Rajwar, R.: Transactional memory, 2nd edn. Synthesis Lectures on Computer Architecture, vol. 5(1) (2010)","DOI":"10.2200\/S00272ED1V01Y201006CAC011"},{"key":"12_CR31","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., Luchangco, V., Moir, M., Scherer III, W.N., Shavit, 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":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-72951-8_11","volume-title":"Structural Information and Communication Complexity","author":"M Herlihy","year":"2007","unstructured":"Herlihy, M., Lev, Y., Luchangco, V., Shavit, N.: A simple optimistic skiplist algorithm. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 124\u2013138. Springer, Heidelberg (2007)"},{"key":"12_CR33","unstructured":"Hicks, M., Foster, J.S., Prattikakis, P.: Lock inference for atomic sections. In: Proceedings of the First ACM SIGPLAN Workshop on Languages Compilers, and Hardware Support for Transactional Computing, June 2006"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC, pp. 151\u2013160 (1994)","DOI":"10.1145\/197917.198079"},{"key":"12_CR35","unstructured":"Jin, G., Zhang, W., Deng, D., Liblit, B., Lu, S.: Automated concurrency-bug fixing. In: OSDI (2012)"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"McCloskey, B., Zhou, F., Gay, D., Brewer, E.: Autolocker: synchronization inference for atomic sections. In: POPL, pp. 346\u2013358 (2006)","DOI":"10.1145\/1111320.1111068"},{"key":"12_CR37","unstructured":"McKenney, P.E.: Is parallel programming hard, and if so, what can you do about it?. Linux Technology Center. IBM Beaverton, August 2012"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: PODC (1996)","DOI":"10.21236\/ADA309412"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Nakaike, T., Michael, M.M.: Lock elision for read-only critical sections in java. In: PLDI, pp. 269\u2013278 (2010)","DOI":"10.1145\/1809028.1806627"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Mittal, N.: Fast concurrent lock-free binary search trees. In: PPoPP, pp. 317\u2013328 (2014)","DOI":"10.1145\/2692916.2555256"},{"issue":"5","key":"12_CR41","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/635508.605399","volume":"36","author":"R Rajwar","year":"2002","unstructured":"Rajwar, R., Goodman, J.R.: Transactional lock-free execution of lock-based programs. SIGOPS Oper. Syst. Rev. 36(5), 5\u201317 (2002)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Roy, A., Hand, S., Harris, T.: A runtime system for software lock elision. In: EuroSys (2009)","DOI":"10.1145\/1519065.1519094"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Shacham, O.: Verifying Atomicity of Composed Concurrent Operations. Ph.D thesis, Tel Aviv University (2012)","DOI":"10.1145\/2048066.2048073"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Shacham, O., Bronson, N., Aiken, A., Sagiv, M., Vechev, M., Yahav, E.: Testing atomicity of composed concurrent operations. In: OOPSLA (2011)","DOI":"10.1145\/2048066.2048073"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Shalev, O., Shavit, N.: Predictive log-synchronization. In: Berbers, Y., Zwaenepoel, W. (eds.) EuroSys, pp. 305\u2013315. ACM (2006)","DOI":"10.1145\/1218063.1217965"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Zyulkyarov, F., Gajinov, V., Unsal, O.S., Cristal, A., Ayguad\u00e9, E., Harris, T., Valero, M.: Atomic quake: using transactional memory in an interactive multiplayer game server. In: ACM Sigplan Notices, vol. 44, pp. 25\u201334. ACM (2009)","DOI":"10.1145\/1594835.1504183"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:39:48Z","timestamp":1559259588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48653-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662486528","9783662486535"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48653-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}