{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:27Z","timestamp":1760202687868,"version":"3.37.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319147192"},{"type":"electronic","value":"9783319147208"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-14720-8_7","type":"book-chapter","created":{"date-parts":[[2014,12,29]],"date-time":"2014-12-29T09:26:01Z","timestamp":1419845161000},"page":"150-165","source":"Crossref","is-referenced-by-count":6,"title":["Multi-versioning in Transactional Memory"],"prefix":"10.1007","author":[{"given":"Idit","family":"Keidar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitri","family":"Perelman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","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), http:\/\/dl.acm.org\/citation.cfm?id=1946143.1946151"},{"key":"7_CR2","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), http:\/\/doi.acm.org\/10.1145\/1583991.1584015"},{"key":"7_CR3","unstructured":"Aydonat, U., Abdelrahman, T.: Serializability of transactions in software transactional memory. In: Second ACM SIGPLAN Workshop on Transactional Computing (2008)"},{"key":"7_CR4","first-page":"475","volume-title":"Lecture Notes in Computer Science","author":"Dmitry Basin","year":"2011","unstructured":"Basin, D., Fan, R., Keidar, I., Kiselov, O., Perelman, D.: CAF\u00c9: Scalable task pools with adjustable fairness and contention. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 475\u2013488. Springer, Heidelberg (2011)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Berenson, H., Bernstein, P., Gray, J., Melton, J., O\u2019Neil, E., O\u2019Neil, P.: A critique of ANSI SQL isolation levels. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 1\u201310 (1995)","DOI":"10.1145\/223784.223785"},{"key":"7_CR6","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley (1987)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.scico.2006.05.009","volume":"63","author":"J. Cachopo","year":"2006","unstructured":"Cachopo, J., Rito-Silva, A.: Versioned boxes as the basis for memory transactions. Science of Computer Programming\u00a063(2), 172\u2013185 (2006)","journal-title":"Science of Computer Programming"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Carvalho, N., Cachopo, J., Rodrigues, L., Rito-Silva, A.: Versioned transactional shared memory for the FenixEDU web application. In: Proceedings of the 2nd Workshop on Dependable Distributed Data Management, pp. 15\u201318 (2008)","DOI":"10.1145\/1435523.1435526"},{"key":"7_CR9","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":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dice, D., Shavit, N.: TLRW: Return of the read-write lock. In: TRANSACT 2009: 4th Workshop on Transactional Computing (February 2009)","DOI":"10.1145\/1810479.1810531"},{"key":"7_CR11","first-page":"1","volume-title":"Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys 2012","author":"A. Dragojevi\u0107","year":"2012","unstructured":"Dragojevi\u0107, A., Harris, T.: Stm in the small: Trading generality for performance in software transactional memory. In: Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys 2012, pp. 1\u201314. ACM, New York (2012), http:\/\/doi.acm.org\/10.1145\/2168836.2168838"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1281100.1281106","volume-title":"PODC 2007: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing","author":"F. Ellen","year":"2007","unstructured":"Ellen, F., Lev, Y., Luchangco, V., Moir, M.: Snzi: Scalable nonzero indicators. In: PODC 2007: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 13\u201322. ACM, New York (2007)"},{"key":"7_CR13","unstructured":"Ennals, R.: Cache sensitive software transactional memory. Tech. rep."},{"issue":"8","key":"7_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/2038037.1941579","volume":"46","author":"S\u00e9rgio Miguel Fernandes","year":"2011","unstructured":"Fernandes, S.M., Cachopo, J.A.: Lock-free and Scalable Multi-Version Software Transactional Memory. In: PPoPP 2011, pp. 179\u2013188 (2011)","journal-title":"ACM SIGPLAN Notices"},{"key":"7_CR15","unstructured":"Fraser, K.: Practical lock freedom. Ph.D. thesis, Cambridge University Computer Laboratory (2003)"},{"key":"7_CR16","unstructured":"Gosling, J., Joy, B., Steele, G., Bracha, G.: The Java Language Specification, 3rd edn. Addison-Wesley Longman (2005)"},{"key":"7_CR17","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)"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.jpdc.2012.02.009","volume":"72","author":"T. Heber","year":"2012","unstructured":"Heber, T., Hendler, D., Suissa, A.: On the impact of serializing contention management on stm performance. J. Parallel Distrib. Comput.\u00a072(6), 739\u2013750 (2012), http:\/\/dx.doi.org\/10.1016\/j.jpdc.2012.02.009","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR19","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)"},{"key":"7_CR20","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":"7_CR21","doi-asserted-by":"crossref","unstructured":"Koskinen, E., Herlihy, M.: Dreadlocks: Efficient deadlock detection. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, pp. 297\u2013303 (2008)","DOI":"10.1145\/1378533.1378585"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M.M. Michael","year":"2004","unstructured":"Michael, M.M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst.\u00a015, 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1996, pp. 267\u2013275 (1996)","DOI":"10.1145\/248052.248106"},{"key":"7_CR24","unstructured":"Napper, J., Alvisi, L.: Lock-free serializable transactions. Tech. rep., The University of Texas at Austin (2005)"},{"issue":"1","key":"7_CR25","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/348.318588","volume":"9","author":"Christos H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: On concurrency control by multiple versions. ACM Trans. Database Syst., 89\u201399 (1984)","journal-title":"ACM Transactions on Database Systems"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Perelman, D., Byshevsky, A., Litmanovich, O., Keidar, I.: SMV: Selective multi-versioning STM. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 125\u2013140. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_9"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, PODC 2001, pp. 16\u201325 (2010)","DOI":"10.1145\/1835698.1835704"},{"issue":"4","key":"7_CR28","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/1594835.1504201","volume":"44","author":"H.E. Ramadan","year":"2009","unstructured":"Ramadan, H.E., Roy, I., Herlihy, M., Witchel, E.: Committing conflicting transactions in an STM. SIGPLAN Not\u00a044(4), 163\u2013172 (2009)","journal-title":"SIGPLAN Not"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Riegel, T., Fetzer, C., Sturzrehm, H., Felber, P.: From causal to z-linearizable transactional memory. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 340\u2013341 (2007)","DOI":"10.1145\/1281100.1281162"},{"key":"7_CR30","first-page":"284","volume-title":"Lecture Notes in Computer Science","author":"Torvald Riegel","year":"2006","unstructured":"Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Proceedings of the 20th International Symposium on Distributed Computing, pp. 284\u2013298 (2006)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Spear, M.F., Michael, M.M., von Praun, C.: RingSTM: Scalable transactions with a single atomic instruction. In: SPAA 2008, pp. 275\u2013284 (2008)","DOI":"10.1145\/1378533.1378583"}],"container-title":["Lecture Notes in Computer Science","Transactional Memory. Foundations, Algorithms, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14720-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T22:03:49Z","timestamp":1566165829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14720-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319147192","9783319147208"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14720-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}