{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:44:39Z","timestamp":1755999879192,"version":"3.40.5"},"publisher-location":"Cham","reference-count":49,"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_4","type":"book-chapter","created":{"date-parts":[[2014,12,29]],"date-time":"2014-12-29T14:26:01Z","timestamp":1419863161000},"page":"72-97","source":"Crossref","is-referenced-by-count":3,"title":["Disjoint-Access Parallelism in Software Transactional Memory"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1016\/j.jpdc.2011.08.002","volume":"71","author":"H. Attiya","year":"2011","unstructured":"Attiya, H., Ellen, F., Fatourou, P.: The complexity of updating snapshot objects. Journal of Parallel and Distributed Computing\u00a071(12), 1570\u20131577 (2011)","journal-title":"Journal of Parallel and Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P.: The complexity of obstruction-free implementations. J. ACM\u00a056(4) (2009)","key":"4_CR2","DOI":"10.1145\/1538902.1538908"},{"unstructured":"Attiya, H., Hans, S.: Transactions are back\u2014but how different they are? In: TRANSACT 2012 (2012)","key":"4_CR3"},{"key":"4_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 Transactions on Computers\u00a062, 2531\u20132543 (2013)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"4_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.\u00a049(4), 698\u2013719 (2011)","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley (2004)","key":"4_CR6","DOI":"10.1002\/0471478210"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-69355-0_12","volume-title":"Structural Information and Communication Complexity","author":"H. Avni","year":"2008","unstructured":"Avni, H., Shavit, N.: Maintaining consistent transactional states without a global clock. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol.\u00a05058, pp. 131\u2013140. Springer, Heidelberg (2008), http:\/\/dx.doi.org\/10.1007\/978-3-540-69355-0_12"},{"doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared-data structures. In: SPAA 1993, pp. 261\u2013270 (1993)","key":"4_CR8","DOI":"10.1145\/165231.165265"},{"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 (SIGMOD 1995), pp. 1\u201310 (1995)","key":"4_CR9","DOI":"10.1145\/568271.223785"},{"unstructured":"Bushkov, V., Dziuma, D., Fatourou, P., Guerraoui, R.: Snapshot isolation does not scale either. In: WTTM 2013 (2013)","key":"4_CR10"},{"key":"4_CR11","first-page":"178","volume-title":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014","author":"V. Bushkov","year":"2014","unstructured":"Bushkov, V., Dziuma, D., Fatourou, P., Guerraoui, R.: The pcl theorem: Transactions cannot be parallel, consistent and live. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 178\u2013187. ACM, New York (2014), http:\/\/doi.acm.org\/10.1145\/2612669.2612690"},{"doi-asserted-by":"crossref","unstructured":"Bushkov, V., Guerraoui, R., Kapa\u0142ika, M.: On the liveness of transactional memory. In: ACM Symposium on Principles of Distributed Computing (PODC 2012), pp. 9\u201318 (2001)","key":"4_CR12","DOI":"10.1145\/2332432.2332435"},{"unstructured":"Dice, D., Shavit, N.: What really makes transactions faster? In: Proc. of the 1st TRANSACT 2006 Workshop (2006)","key":"4_CR13"},{"unstructured":"Dice, D., Matveev, A., Shavit, N.: Implicit privatization using private transactions. In: 5th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2010) (2010)","key":"4_CR14"},{"key":"4_CR15","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.\u00a04167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"4_CR16","first-page":"284","volume-title":"Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010","author":"D. Dice","year":"2010","unstructured":"Dice, D., Shavit, N.: Tlrw: return of the read-write lock. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010, pp. 284\u2013293. ACM, New York (2010), http:\/\/doi.acm.org\/10.1145\/1810479.1810531"},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00165-012-0225-8","volume":"25","author":"S. Doherty","year":"2013","unstructured":"Doherty, S., Groves, L., Luchangco, V., Moir, M.: Towards formally specifying and verifying transactional memory. Formal Aspects of Computing\u00a025(5), 769\u2013799 (2013)","journal-title":"Formal Aspects of Computing"},{"doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Kosmas, E., Milani, A., Travers, C.: Universal constructions that ensure disjoint-access parallelism and wait-freedom. In: ACM Symposium on Principles of Distributed Computing (PODC 2012), pp. 115\u2013124 (2012)","key":"4_CR18","DOI":"10.1145\/2332432.2332457"},{"doi-asserted-by":"crossref","unstructured":"Fatourou, P., Dziuma, D., Kanellou, E.: Consistency for transactional memory computing. Bulletin of European Association for Theoretical Computer Science (EATCS) 113 (June 2014)","key":"4_CR19","DOI":"10.1007\/978-3-319-14720-8_1"},{"key":"4_CR20","first-page":"237","volume-title":"Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2008","author":"P. Felber","year":"2008","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic performance tuning of word-based software transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2008, pp. 237\u2013246. ACM, New York (2008), http:\/\/doi.acm.org\/10.1145\/1345206.1345241"},{"unstructured":"Fraser, K.: Practical lock freedom. Ph.D. thesis, Cambridge University Computer Laboratory (2003), also available as Technical Report UCAM-CL-TR-579","key":"4_CR21"},{"key":"4_CR22","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.: Toward 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":"4_CR23","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)"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On obstruction-free transactions. In: SPAA 2008, pp. 304\u2013313 (2008)","key":"4_CR24","DOI":"10.1145\/1378533.1378587"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On the correctness of transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008), pp. 175\u2013184 (2008)","key":"4_CR25","DOI":"10.1145\/1345206.1345233"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: The semantics of progress in lock-based transactional memory. In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2009), pp. 404\u2013415 (2009)","key":"4_CR26","DOI":"10.1145\/1480881.1480931"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: Principles of Transactional Memory. Synthesis Lectures on Distributed Computing. Morgan & Claypool Publishers (2010)","key":"4_CR27","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"key":"4_CR28","first-page":"197","volume-title":"Proceedings of the Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, PPOPP 1990","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M.: A methodology for implementing highly concurrent data structures. In: Proceedings of the Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, PPOPP 1990, pp. 197\u2013206. ACM, New York (1990), http:\/\/doi.acm.org\/10.1145\/99163.99185"},{"issue":"1","key":"4_CR29","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"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 ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 92\u2013101 (2003)","key":"4_CR30","DOI":"10.1145\/872035.872048"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: Proceedings of the 20th Annual International Symposiupm on Computer Architecture (ISCA 1993) (1993)","key":"4_CR31","DOI":"10.1145\/165123.165164"},{"unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)","key":"4_CR32"},{"issue":"3","key":"4_CR33","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M., de Mendivil, J.R.: Brief announcement: virtual world consistency: A new condition for stm systems. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC 2009), pp. 280\u2013281 (2009)","key":"4_CR34","DOI":"10.1145\/1582716.1582764"},{"doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 151\u2013160 (2004)","key":"4_CR35","DOI":"10.1145\/197917.198079"},{"doi-asserted-by":"crossref","unstructured":"Keidar, I., Perelman, D.: On avoiding spare aborts in transactional memory. In: SPAA 2009, pp. 59\u201368 (2009)","key":"4_CR36","DOI":"10.1145\/1583991.1584013"},{"issue":"2","key":"4_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering SE\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering SE"},{"issue":"28","key":"4_CR38","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"100","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess program. IEEE Transactions on Computers\u00a0100(28), 690\u2013691 (1979)","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"Larus, J.R., Rajwar, R.: Transactional Memory. Morgan and Claypool (2007)","key":"4_CR39","DOI":"10.1007\/978-3-031-01719-3"},{"issue":"9","key":"4_CR40","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1109\/TKDE.2004.34","volume":"16","author":"S. Lu","year":"2004","unstructured":"Lu, S., Bernstein, A., Lewis, P.: Correct execution of transactions at different isolation levels. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1070\u20131081 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"4_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1066650.1066660","volume-title":"Proceedings of the 7th Workshop on Workshop on Languages, Compilers, and Run-time Support for Scalable Systems, LCR 2004","author":"V.J. Marathe","year":"2004","unstructured":"Marathe, V.J., Scherer, W.N., Scott, M.L.: Design tradeoffs in modern software transactional memory systems. In: Proceedings of the 7th Workshop on Workshop on Languages, Compilers, and Run-time Support for Scalable Systems, LCR 2004, pp. 1\u20137. ACM, New York (2004), http:\/\/doi.acm.org\/10.1145\/1066650.1066660"},{"issue":"4","key":"4_CR42","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(4), 631\u2013653 (1979)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010), pp. 16\u201325 (2010)","key":"4_CR43","DOI":"10.1145\/1835698.1835704"},{"doi-asserted-by":"crossref","unstructured":"Rajwar, R., Goodman, J.R.: Transactional lock-free execution of lock-based programs. In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2002), pp. 5\u201317 (2002)","key":"4_CR44","DOI":"10.1145\/605398.605399"},{"unstructured":"Riegel, T., Fetzer, C., Felber, P.: Snapshot isolation for software transactional memory. In: First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT 2006) (2006)","key":"4_CR45"},{"doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC 1995, pp. 204\u2013213 (1995)","key":"4_CR46","DOI":"10.1145\/224964.224987"},{"key":"4_CR47","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1145\/1583991.1584048","volume-title":"Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009","author":"F. Tabba","year":"2009","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. ACM, New York (2009), http:\/\/doi.acm.org\/10.1145\/1583991.1584048"},{"doi-asserted-by":"crossref","unstructured":"Turek, J., Shasha, D., Prakash, S.: Locking without blocking: making lock based concurrent data structure algorithms nonblocking. In: Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1992), pp. 212\u2013222 (1992)","key":"4_CR48","DOI":"10.1145\/137097.137873"},{"key":"4_CR49","volume-title":"Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery","author":"G. Weikum","year":"2001","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, San Francisco (2001)"}],"container-title":["Lecture Notes in Computer Science","Transactional Memory. Foundations, Algorithms, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14720-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T16:18:39Z","timestamp":1747325919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14720-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319147192","9783319147208"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14720-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}