{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:24:04Z","timestamp":1725870244185},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319483139"},{"type":"electronic","value":"9783319483146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48314-6_10","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T15:01:04Z","timestamp":1478185264000},"page":"143-158","source":"Crossref","is-referenced-by-count":5,"title":["In the Search for Optimal Concurrency"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Gramoli","sequence":"first","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-33651-5_21","volume-title":"Distributed Computing","author":"Y Afek","year":"2012","unstructured":"Afek, Y., Matveev, A., Shavit, N.: Pessimistic software lock-elision. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 297\u2013311. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33651-5_21"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Fr\u00f8lund, S., Hadzilacos, V., Horn, S.L., Toueg, S.: Abortable and query-abortable objects and their efficient implementation. In: PODC, pp. 23\u201332 (2007)","DOI":"10.1145\/1281100.1281107"},{"key":"10_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley, New York (2004)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1006\/jcss.1998.1563","volume":"57","author":"VK Chaudhri","year":"1998","unstructured":"Chaudhri, V.K., Hadzilacos, V.: Safe locking policies for dynamic databases. J. Comput. Syst. Sci. 57(3), 260\u2013271 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: NOrec: streamlining STM by abolishing ownership records. In: PPOPP, pp. 67\u201378 (2010)","DOI":"10.1145\/1693453.1693464"},{"key":"10_CR6","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\/2694344.2694359"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.entcs.2010.01.001","volume":"259","author":"S Doherty","year":"2009","unstructured":"Doherty, S., Groves, L., Luchangco, V., Moir, M.: Towards formally specifying and verifying transactional memory. Electron. Notes Theor. Comput. Sci. 259, 245\u2013261 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic performance tuning of word-based software transactional memory. In: PPoPP, pp. 237\u2013246 (2008)","DOI":"10.1145\/1345206.1345241"},{"key":"10_CR9","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":"1","key":"10_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/2541883.2541900","volume":"57","author":"V Gramoli","year":"2014","unstructured":"Gramoli, V., Guerraoui, R.: Democratizing transactional programming. Commun. ACM 57(1), 86\u201393 (2014)","journal-title":"Commun. ACM"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1142\/S0129626410000041","volume":"20","author":"V Gramoli","year":"2010","unstructured":"Gramoli, V., Harmanci, D., Felber, P.: On the input acceptance of transactional memory. Parallel Process. Lett. 20(1), 31\u201350 (2010)","journal-title":"Parallel Process. Lett."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S.: In the search of optimal concurrency. CoRR, abs\/1603.01384 (2016)","DOI":"10.1007\/978-3-319-48314-6_10"},{"key":"10_CR13","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S., Shang, D.: Brief announcement: a concurrency-optimal list-based set. In: 29th International Symposium on Distributed Computing, DISC 2015, Tokyo, Japan, 7\u20139 October 2015. Technical report http:\/\/arxiv.org\/abs\/1502.01633"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87779-0_21","volume-title":"Distributed Computing","author":"R Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 305\u2013319. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-87779-0_21"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02002-5","volume-title":"Principles of Transactional Memory: Synthesis Lectures on Distributed Computing Theory","author":"R Guerraoui","year":"2010","unstructured":"Guerraoui, R., Kapalka, M.: Principles of Transactional Memory: Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool, San Rafael (2010)"},{"key":"10_CR16","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. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45414-4_21"},{"key":"10_CR17","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, 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). doi: 10.1007\/11795490_3"},{"issue":"1","key":"10_CR18","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/77643.77647","volume":"15","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M.: Apologizing versus asking permission: optimistic concurrency control for abstract data types. ACM Trans. Database Syst. 15(1), 96\u2013124 (1990)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10_CR19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: ISCA, pp. 289\u2013300 (1993)","DOI":"10.1145\/165123.165164"},{"key":"10_CR21","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, San Francisco (2008)"},{"key":"10_CR22","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). doi: 10.1007\/978-3-642-25873-2_22"},{"issue":"3","key":"10_CR23","doi-asserted-by":"crossref","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. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Imbs, D., de Mend\u00edvil, J.R.G., Raynal, M.: Brief announcement: virtual world consistency: a new condition for STM systems. In: PODC, pp. 280\u2013281 (2009)","DOI":"10.1145\/1582716.1582764"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Kung, H.T., Papadimitriou, C.H.: An optimality theory of concurrency control for databases. In: SIGMOD, pp. 116\u2013126 (1979)","DOI":"10.1145\/582095.582114"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26, 631\u2013653 (1979)","journal-title":"J. ACM"},{"issue":"6","key":"10_CR27","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC, pp. 204\u2013213 (1995)","DOI":"10.1145\/224964.224987"},{"issue":"12","key":"10_CR29","doi-asserted-by":"crossref","first-page":"1488","DOI":"10.1109\/12.9728","volume":"37","author":"WE Weihl","year":"1988","unstructured":"Weihl, W.E.: Commutativity-based concurrency control for abstract data types. IEEE Trans. Comput. 37(12), 1488\u20131505 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Weikum, G.: A theoretical foundation of multi-level concurrency control. In: PODS, pp. 31\u201343 (1986)","DOI":"10.1145\/6012.15401"},{"key":"10_CR31","volume-title":"Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery","author":"G Weikum","year":"2002","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, San Francisco (2002)"},{"issue":"2","key":"10_CR32","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/62.322425","volume":"31","author":"M Yannakakis","year":"1984","unstructured":"Yannakakis, M.: Serializability by locking. J. ACM 31(2), 227\u2013244 (1984)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48314-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T05:41:56Z","timestamp":1657604516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48314-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483139","9783319483146"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48314-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}