{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:43Z","timestamp":1725574123874},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"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-17679-1_8","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T13:44:30Z","timestamp":1294235070000},"page":"83-94","source":"Crossref","is-referenced-by-count":7,"title":["Single-Version STMs Can Be Multi-version Permissive (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations. In: PODC 1997, pp. 111\u2013120 (1997)","DOI":"10.1145\/259380.259431"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. In: SPAA 2009, pp. 69\u201378 (2009)","DOI":"10.1145\/1583991.1584015"},{"key":"8_CR3","unstructured":"Aydonat, U., Abdelrahman, T.: Serializability of transactions in software transactional memory. In: TRANSACT 2008 (2008)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Dice, D., Lev, Y., Marathe, V.J., Moir, M., Nussbaum, D., Olszewski, M.: Simplifying concurrent algorithms by exploiting hardware transactional memory. In: SPAA 2010, pp. 325\u2013334 (2010)","DOI":"10.1145\/1810479.1810537"},{"key":"8_CR5","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.\u00a04167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Dice, D., Shavit, N.: TLRW: Return of the read-write lock. In: SPAA 2010, pp. 284\u2013293 (2010)","DOI":"10.1145\/1810479.1810531"},{"key":"8_CR7","unstructured":"Ennals, R.: Software transactional memory should not be obstruction-free. Technical Report IRC-TR-06-052, Intel Research Cambridge Tech. Report (2006)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-92221-6_33","volume-title":"Principles of Distributed Systems","author":"V. Gramoli","year":"2008","unstructured":"Gramoli, V., Harmanci, D., Felber, P.: Towards a theory of input acceptance for transactional memories. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 527\u2013533. Springer, Heidelberg (2008)"},{"key":"8_CR9","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":"8_CR10","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On obstruction-free transactions. In: SPAA 2008, pp. 304\u2013313 (2008)","DOI":"10.1145\/1378533.1378587"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPoPP 2008, pp. 175\u2013184 (2008)","DOI":"10.1145\/1345206.1345233"},{"issue":"1","key":"8_CR12","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/1594834.1480931","volume":"44","author":"Rachid Guerraoui","year":"2009","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: POPL 2009, pp. 404\u2013415 (2009)","journal-title":"ACM SIGPLAN Notices"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III., W.N.: Software transactional memory for dynamic-sized data structures. In: PODC 2003, pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC 1994, pp. 151\u2013160 (1994)","DOI":"10.1145\/197917.198079"},{"key":"8_CR15","unstructured":"Kapalka, M.: Theory of Transactional Memory. PhD thesis, EPFL (2010)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Keidar, I., Perelman, D.: On avoiding spare aborts in transactional memory. In: SPAA 2009, pp. 59\u201368 (2009)","DOI":"10.1145\/1583991.1584013"},{"key":"8_CR17","unstructured":"Lev, Y., Luchangco, V., Marathe, V.J., Moir, M., Nussbaum, D., Olszewski, M.: Anatomy of a scalable software transactional memory. In: TRANSACT 2009 (2009)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Luchangco, V., Moir, M., Shavit, N.: Nonblocking k-compare-single-swap. In: SPAA 2003, pp. 314\u2013323 (2003)","DOI":"10.1145\/777466.777468"},{"key":"8_CR19","unstructured":"Napper, J., Alvisi, L.: Lock-free serializable transactions. Technical Report TR-05-04, The University of Texas at Austin (2005)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: PODC 2010, pp. 16\u201325 (2010)","DOI":"10.1145\/1835698.1835704"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Perelman, D., Keidar, I.: SMV: Selective Multi-Versioning STM. In: TRANSACT 2010 (2010)","DOI":"10.1007\/978-3-642-24100-0_9"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11864219_20","volume-title":"Distributed Computing","author":"T. Riegel","year":"2006","unstructured":"Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 284\u2013298. Springer, Heidelberg (2006)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Saha, B., Adl-Tabatabai, A.-R., Hudson, R.L., Cao Minh, C., Hertzberg, B.: McRT-STM: a high performance software transactional memory system for a multi-core runtime. In: PPoPP 2006, pp. 187\u2013197 (2006)","DOI":"10.1145\/1122971.1123001"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T12:09:29Z","timestamp":1559909369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}