{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:44Z","timestamp":1760202644472},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642240997"},{"type":"electronic","value":"9783642241000"}],"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-24100-0_9","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T02:20:40Z","timestamp":1318990840000},"page":"125-140","source":"Crossref","is-referenced-by-count":21,"title":["SMV: Selective Multi-Versioning STM"],"prefix":"10.1007","author":[{"given":"Dmitri","family":"Perelman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Byshevsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Litmanovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"http:\/\/www.azulsystems.com\/blog\/cliff-click\/2008-05-27-clojure-stms-vs-locks"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hillel, E.: Brief announcement: Single-Version STMs can be Multi-Version Permissive. In: Proceedings of the 29th Symposium on Principles of Distributed Computing (2010)","DOI":"10.1145\/1835698.1835712"},{"key":"9_CR3","unstructured":"Aydonat, U., Abdelrahman, T.: Serializability of transactions in software transactional memory. In: Second ACM SIGPLAN Workshop on Transactional Computing (2008)"},{"key":"9_CR4","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":"9_CR5","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P.A. Bernstein","year":"1987","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bieniusa, A., Fuhrmann, T.: Consistency in hindsight, a fully decentralized stm algorithm. In: IPDPS 2010: Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (2010)","DOI":"10.1109\/IPDPS.2010.5470446"},{"issue":"2","key":"9_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":"9_CR8","doi-asserted-by":"crossref","unstructured":"Cao Minh, C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: IISWC 2008: Proceedings of The IEEE International Symposium on Workload Characterization (September 2008)","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"9_CR9","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":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-15291-7_2","volume-title":"Euro-Par 2010 - Parallel Processing","author":"L. Dalessandro","year":"2010","unstructured":"Dalessandro, L., Dice, D., Scott, M., Shavit, N., Spear, M.: Transactional mutex locks. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol.\u00a06272, pp. 2\u201313. Springer, Heidelberg (2010)"},{"key":"9_CR11","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":"9_CR12","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":"9_CR13","unstructured":"Ennals, R.: Cache sensitive software transactional memory. Technical report"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic performance tuning of word-based software transactional memory. In: PPoPP 2008, pp. 237\u2013246 (2008)","DOI":"10.1145\/1345206.1345241"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Fernandes, S.M., Cachopo, J.A.: Lock-free and Scalable Multi-Version Software Transactional Memory. In: PPoPP 2011, pp. 179\u2013188 (2011)","DOI":"10.1145\/1941553.1941579"},{"key":"9_CR16","unstructured":"Fraser, K.: Practical lock freedom. PhD thesis. Cambridge University Computer Laboratory (2003)"},{"key":"9_CR17","volume-title":"The Java Language Specification","author":"J. Gosling","year":"2005","unstructured":"Gosling, J., Joy, B., Steele, G., Bracha, G.: The Java Language Specification, 3rd edn. Addison-Wesley Longman, Amsterdam (2005)","edition":"3"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M., Vitek, J.: STMBench7: A Benchmark for Software Transactional Memory. In: Proceedings of the Second European Systems Conference (2007)","DOI":"10.1145\/1272996.1273029"},{"key":"9_CR19","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"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News\u00a021(2), 289\u2013300 (1993)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"9_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":"9_CR22","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":"9_CR23","unstructured":"Korland, G., Shavit, N., Felber, P.: Noninvasive Java concurrency with Deuce STM (poster). In: SYSTOR 2009 (2009), Further details at http:\/\/www.deucestm.org\/"},{"key":"9_CR24","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":"9_CR25","unstructured":"Napper, J., Alvisi, L.: Lock-free serializable transactions. Technical report, The University of Texas at Austin (2005)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Perelman, D., Byshevsky, A., Litmanovich, O., Keidar, I.: SMV: Selective Multi-Versioning STM. Technical report, Technion (2011)","DOI":"10.1007\/978-3-642-24100-0_9"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in transactional memory. In: PODC (2010)","DOI":"10.1145\/1835698.1835704"},{"issue":"4","key":"9_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":"9_CR29","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":"9_CR30","unstructured":"Riegel, T., Fetzer, C., Felber, P.: Snapshot isolation for software transactional memory. In: 1st ACM SIGPLAN Workshop on Transactional Computing, TRANSACT (2006)"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: PODC 2005, pp. 240\u2013248 (2005)","DOI":"10.1145\/1073814.1073861"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 204\u2013213 (1995)","DOI":"10.1145\/224964.224987"},{"key":"9_CR33","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","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24100-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T22:48:25Z","timestamp":1560811705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24100-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240997","9783642241000"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24100-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}