{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T09:37:14Z","timestamp":1790933834939,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258725","type":"print"},{"value":"9783642258732","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_9","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"112-127","source":"Crossref","is-referenced-by-count":15,"title":["On the Cost of Concurrency in Transactional Memory"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"12","key":"9_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S.V. Adve","year":"1996","unstructured":"Adve, S.V., Gharachorloo, K.: Shared memory consistency models: A tutorial. IEEE Computer\u00a029(12), 66\u201376 (1996)","journal-title":"IEEE Computer"},{"key":"9_CR2","unstructured":"Afek, Y., Morrison, A., Tzafrir, M.: View transactions: Transactional model with relaxed consistency checks. In: PODC 2010: Proceedings of the 29th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (2010)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters\u00a021(4), 181\u2013185 (1985)","DOI":"10.1016\/0020-0190(85)90056-0"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T.E. Anderson","year":"1990","unstructured":"Anderson, T.E.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst.\u00a01(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TPDS.2009.60","volume":"21","author":"H. Attiya","year":"2010","unstructured":"Attiya, H., Hendler, D.: Time and space lower bounds for implementations using k-cas. IEEE Transactions on Parallel and Distributed Systems\u00a021(2), 162\u2013173 (2010)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M.V.M.: Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated. In: POPL (2011)","DOI":"10.1145\/1926385.1926442"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-17679-1_8","volume-title":"Distributed Computing and Networking","author":"H. Attiya","year":"2011","unstructured":"Attiya, H., Hillel, E.: Single-Version STMs Can Be Multi-Version Permissive (Extended Abstract). In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 83\u201394. Springer, Heidelberg (2011)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1583991.1584015","volume-title":"Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009","author":"H. Attiya","year":"2009","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. In: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 69\u201378. ACM, New York (2009)"},{"key":"9_CR9","unstructured":"Crain, T., Imbs, D., Raynal, M.: Read invisibility, virtual world consistency and permissiveness are compatible. Research Report, ASAP - INRIA - IRISA - CNRS: UMR6074 - INRIA - Institut National des Sciences Appliqu\u00e9es de Rennes - Universit\u00e9 de Rennes I (November 2010)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-04355-0_12","volume-title":"Distributed Computing","author":"P. Felber","year":"2009","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic Transactions. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 93\u2013107. Springer, Heidelberg (2009)"},{"key":"9_CR11","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.\u00a05218, pp. 305\u2013319. Springer, Heidelberg (2008)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1145\/1378533.1378587","volume-title":"Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M.: On obstruction-free transactions. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 304\u2013313. ACM, New York (2008)"},{"key":"9_CR13","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":"9_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: POPL, pp. 404\u2013415 (2009)","DOI":"10.1145\/1594834.1480931"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: Principles of Transactional Memory, Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool (2010)","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: SPAA, pp. 355\u2013364 (2010)","DOI":"10.1145\/1810479.1810540"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/197917.198079","volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1994","author":"A. Israeli","year":"1994","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1994, pp. 151\u2013160. ACM, New York (1994)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Ravi, S.: On the cost of concurrency in transactional memory. CoRR, abs\/1103.1302 (2011)","DOI":"10.1007\/978-3-642-25873-2_9"},{"issue":"8","key":"9_CR19","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A New Solution of Dijkstra\u2019s Concurrent Programming Problem. Commun. ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"key":"9_CR20","unstructured":"Lee, J.: Compilation Techniques for Explicitly Parallel Programs. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign (1999)"},{"key":"9_CR21","unstructured":"McKenney, P.: Concurrent code and expensive instructions. Linux Weekly News (January 2011), http:\/\/lwn.net\/Articles\/423994\/"},{"key":"9_CR22","unstructured":"McKenney, P.E.: Memory barriers: a hardware view for software hackers. Linux Technology Center, IBM Beaverton (June 2010)"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"C.H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM\u00a026, 631\u2013653 (1979)","journal-title":"J. ACM"},{"key":"9_CR24","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion. MIT Press (1986)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-30186-8_5","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2004","unstructured":"Taubenfeld, G.: The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. In: Liu, H. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 56\u201370. Springer, Heidelberg (2004)"}],"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-25873-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:53:06Z","timestamp":1561031586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}