{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:09:21Z","timestamp":1743066561886,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319219080"},{"type":"electronic","value":"9783319219097"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21909-7_40","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:04Z","timestamp":1437718564000},"page":"410-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Progressive Transactional Memory in Time and Space"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gilbert, S., Guerraoui, R.: The complexity of renaming. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, 22\u201325 October, 2011, pp. 718\u2013727, Palm Springs, CA, USA (2011)","DOI":"10.1109\/FOCS.2011.66"},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"TE Anderson","year":"1990","unstructured":"Anderson, T.E.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hendler, D., Woelfel, P.: Tight RMR lower bounds for mutual exclusion and other problems. In: Proceedings of the Twenty-seventh ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 447\u2013447, New York, NY, USA. ACM (2008)","DOI":"10.1145\/1400751.1400843"},{"issue":"12","key":"40_CR4","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1109\/TC.2012.159","volume":"62","author":"H Attiya","year":"2013","unstructured":"Attiya, H., Hillel, E.: The cost of privatization in software transactional memory. IEEE Trans. Comput. 62(12), 2531\u20132543 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"40_CR5","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/s00224-010-9304-5","volume":"49","author":"H Attiya","year":"2011","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. Theory Comput. Syst. 49(4), 698\u2013719 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"40_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1837853.1693464","volume":"45","author":"L Dalessandro","year":"2010","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: Norec: streamlining STM by abolishing ownership records. SIGPLAN Not. 45(5), 67\u201378 (2010)","journal-title":"SIGPLAN Not."},{"key":"40_CR7","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.N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"40_CR8","unstructured":"Dice, D., Shavit, N.: What really makes transactions fast? In: Transact (2006)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Dice, D., Shavit, N.: TLRW: return of the read-write lock. In: SPAA, pp. 284\u2013293 (2010)","DOI":"10.1145\/1810479.1810531"},{"issue":"3","key":"40_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/08072646X","volume":"41","author":"F Ellen","year":"2012","unstructured":"Ellen, F., Hendler, D., Shavit, N.: On the inherent sequentiality of concurrent objects. SIAM J. Comput. 41(3), 519\u2013536 (2012)","journal-title":"SIAM J. Comput."},{"key":"40_CR11","unstructured":"Fraser, K.: Practical lock-freedom. Technical report, Cambridge University Computer Laborotory (2003)"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/1594834.1480931","volume":"44","author":"R Guerraoui","year":"2009","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. SIGPLAN Not. 44(1), 404\u2013415 (2009)","journal-title":"SIGPLAN Not."},{"key":"40_CR13","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02002-5","volume-title":"Principles of Transactional Memory","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":"40_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 92\u2013101, New York, NY, USA. ACM (2003)","DOI":"10.1145\/872035.872048"},{"key":"40_CR15","unstructured":"Hyonho, L.: Local-spin mutual exclusion algorithms on the DSM model using fetch-and-store objects (2003). http:\/\/www.cs.toronto.edu\/pub\/hlee\/thesis.ps"},{"key":"40_CR16","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":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-25873-2_9","volume-title":"Principles of Distributed Systems","author":"P Kuznetsov","year":"2011","unstructured":"Kuznetsov, P., Ravi, S.: On the cost of concurrency in transactional memory. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 112\u2013127. Springer, Heidelberg (2011)"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Ravi, S.: On partial wait-freedom in transactional memory. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking, ICDCN 2015, Goa, India, p. 10, 4\u20137 Jan 2015","DOI":"10.1145\/2684464.2684473"},{"key":"40_CR19","doi-asserted-by":"publisher","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"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: PODC, pp. 16\u201325 (2010)","DOI":"10.1145\/1835698.1835704"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Tabba, F., Moir, M., Goodman, J.R., Hay, A.W., Wang, C.: Nztm: nonblocking zero-indirection transactional memory. In: Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 204\u2013213, New York, NY, USA. ACM (2009)","DOI":"10.1145\/1583991.1584048"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21909-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:21:08Z","timestamp":1674246068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21909-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319219080","9783319219097"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21909-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}