{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:37Z","timestamp":1725574117217},"publisher-location":"Berlin, Heidelberg","reference-count":47,"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_1","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T13:44:30Z","timestamp":1294235070000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"title":["Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"PowerPC Microprocessor Family: The Programming Environment (1991)"},{"key":"1_CR2","unstructured":"Advanced Micro Devices, Inc. Advanced Synchronization Facility - Proposed Architectural Specification, 2.1 edition (March 2009)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P.: The complexity of obstruction-free implementations. J.\u00a0ACM\u00a056(4) (2009)","DOI":"10.1145\/1538902.1538908"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11864219_3","volume-title":"Distributed Computing","author":"H. Attiya","year":"2006","unstructured":"Attiya, H., Hillel, E.: Built-in coloring for highly-concurrent doubly-linked lists. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 31\u201345. Springer, Heidelberg (2006)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-15763-9_5","volume-title":"Distributed Computing","author":"H. Attiya","year":"2010","unstructured":"Attiya, H., Hillel, E.: The cost of privatization. In: Lynch, N.A., Shvartsman, A.A. (eds.) Distributed Computing. LNCS, vol.\u00a06343, pp. 35\u201349. Springer, Heidelberg (2010)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-77444-0_9","volume-title":"Distributed Computing and Networking","author":"H. Attiya","year":"2008","unstructured":"Attiya, H., Hillel, E.: Highly-concurrent multi-word synchronization. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 112\u2013123. Springer, Heidelberg (2008)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. In: SPAA 2009 (2009)","DOI":"10.1145\/1583991.1584015"},{"key":"1_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, Chichester (2004)","edition":"2"},{"key":"1_CR9","first-page":"261","volume":"1993","author":"G. Barnes","year":"1993","unstructured":"Barnes, G.: A method for implementing lock-free shared-data structures. In: SPAA 1993, pp. 261\u2013270 (1993)","journal-title":"SPAA"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/568271.223785","volume":"1995","author":"H. Berenson","year":"1995","unstructured":"Berenson, H., Bernstein, P., Gray, J., Melton, J., O\u2019Neil, E., O\u2019Neil, P.: A critique of ANSI SQL isolation levels. In: SIGMOD 1995, pp. 1\u201310 (1995)","journal-title":"SIGMOD"},{"issue":"11","key":"1_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1400214.1400228","volume":"51","author":"C. Cascaval","year":"2008","unstructured":"Cascaval, C., Blundell, C., Michael, M., Cain, H.W., Wu, P., Chiras, S., Chatterjee, S.: Software transactional memory: why is it only a research toy? Commun. ACM\u00a051(11), 40\u201346 (2008)","journal-title":"ACM"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MM.2009.34","volume":"29","author":"S. Chaudhry","year":"2009","unstructured":"Chaudhry, S., Cypher, R., Ekman, M., Karlsson, M., Landin, A., Yip, S., Zeffer, H., Tremblay, M.: Rock: A high-performance SPARC CMT processor. IEEE Micro.\u00a029(2), 6\u201316 (2009)","journal-title":"IEEE Micro"},{"key":"1_CR13","first-page":"335","volume":"2010","author":"P. Chuong","year":"2010","unstructured":"Chuong, P., Ellen, F., Ramachandran, V.: A universal construction for wait-free transaction friendly data structures. In: SPAA 2010, pp. 335\u2013344 (2010)","journal-title":"SPAA"},{"key":"1_CR14","first-page":"325","volume":"2010","author":"D. Dice","year":"2010","unstructured":"Dice, D., Lev, Y., Marathe, V., Moir, M., Olszewski, M., Nussbaum, D.: Simplifying concurrent algorithms by exploiting hardware tm. In: SPAA 2010, pp. 325\u2013334 (2010)","journal-title":"SPAA"},{"key":"1_CR15","unstructured":"Dice, D., Matveev, A., Shavit, N.: Implicit privatization using private transactions. In: Transact 2010 (2010)"},{"key":"1_CR16","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":"1_CR17","unstructured":"Dice, D., Shavit, N.: What really makes transactions fast? In: Transact 2006 (2006)"},{"key":"1_CR18","unstructured":"Digital Equipment Corporation. Alpha Architecture Handbook (1992)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-15763-9_11","volume-title":"Distributed Computing","author":"P. Felber","year":"2010","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic transactions. In: Lynch, N.A., Shvartsman, A.A. (eds.) Distributed Computing. LNCS, vol.\u00a06343, pp. 93\u2013107. Springer, Heidelberg (2010)"},{"key":"1_CR20","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":"1_CR21","first-page":"263","volume":"2010","author":"R. Guerraoui","year":"2010","unstructured":"Guerraoui, R., Henzinger, T., Kapalka, M., Singh, V.: Transactions in the jungle. In: SPAA 2010, pp. 263\u2013272 (2010)","journal-title":"SPAA"},{"key":"1_CR22","first-page":"304","volume":"2008","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M.: On obstruction-free transactions. In: SPAA 2008, pp. 304\u2013313 (2008)","journal-title":"SPAA"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/1345206.1345233","volume":"2008","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPoPP 2008, pp. 175\u2013184 (2008)","journal-title":"PPoPP"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/1480881.1480931","volume":"2009","author":"R. 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":"POPL"},{"key":"1_CR25","first-page":"355","volume":"2010","author":"D. Hendler","year":"2010","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: SPAA 2010, pp. 355\u2013364 (2010)","journal-title":"SPAA"},{"issue":"1","key":"1_CR26","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."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/1345206.1345237","volume":"2008","author":"M. Herlihy","year":"2008","unstructured":"Herlihy, M., Koskinen, E.: Transactional boosting: a methodology for highly-concurrent transactional objects. In: PPoPP 2008, pp. 207\u2013216 (2008)","journal-title":"PPoPP"},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/872035.872048","volume":"2003","author":"M. Herlihy","year":"2003","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)","journal-title":"PODC"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: ISCA 1993 (1993)","DOI":"10.1145\/165123.165164"},{"key":"1_CR30","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)"},{"issue":"3","key":"1_CR31","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."},{"key":"1_CR32","first-page":"151","volume":"2004","author":"A. Israeli","year":"2004","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC 2004, pp. 151\u2013160 (2004)","journal-title":"PODC"},{"key":"1_CR33","unstructured":"Kapalka, M.: Theory of Transactional Memory. Nr.\u00a04664, EPFL (2010)"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1583991.1584013","volume":"2009","author":"I. Keidar","year":"2009","unstructured":"Keidar, I., Perelman, D.: On avoiding spare aborts in transactional memory. In: SPAA 2009, pp. 59\u201368 (2009)","journal-title":"SPAA"},{"issue":"2","key":"1_CR35","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\u00a0SE-3(2), 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering\u00a0SE"},{"issue":"28","key":"1_CR36","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"},{"key":"1_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01719-3","volume-title":"Transactional Memory","author":"J.R. Larus","year":"2007","unstructured":"Larus, J.R., Rajwar, R.: Transactional Memory. Morgan and Claypool, San Francisco (2007)"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Moir, M., Moore, K., Nussbaum, D.: The adaptive transactional memory test platform: A tool for experimenting with transactional code for Rock. In: Transact 2008 (2008)","DOI":"10.1145\/1378533.1378595"},{"issue":"4","key":"1_CR39","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"},{"key":"1_CR40","first-page":"16","volume":"2010","author":"D. Perelman","year":"2010","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: PODC 2010, pp. 16\u201325 (2010)","journal-title":"PODC"},{"key":"1_CR41","unstructured":"Pingali, K., Kulkarni, M., Nguyen, D., Burtscher, M., Mendez-Lojo, M., Prountzos, D., Sui, X., Zhong, Z.: Amorphous data-parallelism in irregular algorithms. Technical Report TR-09-05, The University of Texas at Austin, Department of Computer Sciences (2009)"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/605397.605399","volume":"2002","author":"R. Rajwar","year":"2002","unstructured":"Rajwar, R., Goodman, J.R.: Transactional lock-free execution of lock-based programs. In: ASPLOS 2002, pp. 5\u201317 (2002)","journal-title":"ASPLOS"},{"key":"1_CR43","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1145\/224964.224987","volume":"1995","author":"N. Shavit","year":"1995","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC 1995, pp. 204\u2013213 (1995)","journal-title":"PODC"},{"issue":"6","key":"1_CR44","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1273442.1250744","volume":"42","author":"T. Shpeisman","year":"2007","unstructured":"Shpeisman, T., Menon, V., Adl-Tabatabai, A.-R., Balensiefer, S., Grossman, D., Hudson, R.L., Moore, K.F., Saha, B.: Enforcing isolation and ordering in STM. SIGPLAN Not.\u00a042(6), 78\u201388 (2007)","journal-title":"SIGPLAN Not"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Spear, M.F., Marathe, V.J., Dalessandro, L., Scott, M.L.: Privatization techniques for software transactional memory. Technical Report Tr 915, Dept. of Computer Science, Univ. of Rochester (2007)","DOI":"10.1145\/1281100.1281161"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Turek, J., Shasha, D., Prakash, S.: Locking without blocking: making lock based concurrent data structure algorithms nonblocking. In: PODS 1992, pp. 212\u2013222 (1992)","DOI":"10.1145\/137097.137873"},{"key":"1_CR47","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","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T15:12:52Z","timestamp":1685891572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}