{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:13Z","timestamp":1725563473857},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_5","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"35-49","source":"Crossref","is-referenced-by-count":4,"title":["The Cost of Privatization"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Birrell, A., Harris, T., Hsieh, J., Isard, M.: Implementation and use of transactional memory with dynamic separation. In: CC \u201909, pp. 63\u201377 (2009)","DOI":"10.1007\/978-3-642-00722-4_6"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Birrell, A., Harris, T., Isard, M.: Semantics of transactional memory and automatic mutual exclusion. In: POPL \u201908, pp. 63\u201374 (2008)","DOI":"10.1145\/1328438.1328449"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, M., Harris, T., Mehrara, M.: Transactional memory with strong atomicity using off-the-shelf memory protection hardware. In: PPoPP\u201909, pp. 185\u2013196 (2009)","DOI":"10.1145\/1594835.1504203"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hillel, E.: The cost of privatization. Technical Report CS-2010-11, Department of Computer Science, Technion. (2010)","DOI":"10.1007\/978-3-642-15763-9_5"},{"key":"5_CR5","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)"},{"issue":"7","key":"5_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. ACM Commun.\u00a013(7), 422\u2013426 (1970)","journal-title":"ACM Commun."},{"issue":"11","key":"5_CR7","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? ACM Commun.\u00a051(11), 40\u201346 (2008)","journal-title":"ACM Commun."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: NOrec: Streamlining STM by abolishing ownership records. In: PPoPP \u201910 (2010)","DOI":"10.1145\/1693453.1693464"},{"key":"5_CR9","unstructured":"Dice, D., Matveev, A., Shavit, N.: Implicit privatization using private transactions. In: TRANSACT \u201910 (2010)"},{"key":"5_CR10","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":"5_CR11","doi-asserted-by":"crossref","unstructured":"Dice, D., Shavit, N.: TLRW: Return of the read-write lock. In: SPAA \u201910 (2010)","DOI":"10.1145\/1810479.1810531"},{"key":"5_CR12","unstructured":"Dragojevic, A., Felber, P., Gramoli, V., Guerraoui, R.: Why STM can be more than a Research Toy. Technical Report LPD-REPORT-2009-003, EPFL (2009)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Gottschlich, J.E., Vachharajani, M., Jeremy, S.G.: An efficient software transactional memory using commit-time invalidation. In: CGO\u201910 (2010)","DOI":"10.1145\/1772954.1772970"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Henzinger, T., Kapalka, M., Singh, V.: Transactions in the jungle. In: SPAA \u201910, pp. 275\u2013284 (2010)","DOI":"10.1145\/1810479.1810529"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPoPP \u201908, pp. 175\u2013184 (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: POPL \u201909, pp. 404\u2013415 (2009)","DOI":"10.1145\/1594834.1480931"},{"key":"5_CR17","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS \u201903, p. 522 (2003)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access parallel implementations of strong shared memory primitives. In: PODC \u201994, pp. 151\u2013160 (1994)","DOI":"10.1145\/197917.198079"},{"key":"5_CR19","volume-title":"Transactional Memory","author":"J.R. Larus","year":"2006","unstructured":"Larus, J.R., Rajwar, R.: Transactional Memory. Morgan & Claypool, San Francisco (2006)"},{"key":"5_CR20","unstructured":"Lev, Y., Luchangco, V., Marathe, V.J., Moir, M., Nussbaum, D., Olszewski, M.: Anatomy of a scalable software transactional memory. In: TRANSACT \u201909 (2009)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Marathe, V.J., Spear, M.F., Scott, M.L.: Scalable techniques for transparent privatization in software transactional memory. In: ICPP \u201908, pp. 67\u201374 (2008)","DOI":"10.1109\/ICPP.2008.69"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/L-CA.2006.18","volume":"5","author":"M. Martin","year":"2006","unstructured":"Martin, M., Blundell, C., Lewis, E.: Subtleties of transactional memory atomicity semantics. IEEE Comput. Archit. Lett.\u00a05(2), 17 (2006)","journal-title":"IEEE Comput. Archit. Lett."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Menon, V., Balensiefer, S., Shpeisman, T., Adl-Tabatabai, A.-R., Hudson, R.L., Saha, B., Welc, A.: Practical weak-atomicity semantics for Java STM. In: SPAA \u201908, pp. 314\u2013325 (2008)","DOI":"10.1145\/1378533.1378588"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Olszewski, M., Cutler, J., Steffan, J.G.: JudoSTM: A dynamic binary-rewriting approach to software transactional memory. In: PACT \u201907, pp. 365\u2013375 (2007)","DOI":"10.1109\/PACT.2007.4336226"},{"key":"5_CR25","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":"5_CR26","doi-asserted-by":"crossref","unstructured":"Riegel, T., Fetzer, C., Felber, P.: Time-based transactional memory with scalable time bases. In: SPAA \u201907, pp. 221\u2013228 (2007)","DOI":"10.1145\/1248377.1248415"},{"issue":"10","key":"5_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/1449955.1449779","volume":"43","author":"F.T. Schneider","year":"2008","unstructured":"Schneider, F.T., Menon, V., Shpeisman, T., Adl-Tabatabai, A.-R.: Dynamic optimization for efficient strong atomicity. SIGPLAN Not.\u00a043(10), 181\u2013194 (2008)","journal-title":"SIGPLAN Not."},{"issue":"6","key":"5_CR28","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":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-92221-6_19","volume-title":"Principles of Distributed Systems","author":"M.F. Spear","year":"2008","unstructured":"Spear, M.F., Dalessandro, L., Marathe, V.J., Scott, M.L.: Ordering-based semantics for software transactional memory. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 275\u2013294. Springer, Heidelberg (2008)"},{"key":"5_CR30","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":"5_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 \u201908, pp. 275\u2013284 (2008)","DOI":"10.1145\/1378533.1378583"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen, W.-Y., Wu, Y., Saha, B., Adl-Tabatabai, A.-R.: Code generation and optimization for transactional memory constructs in an unmanaged language. In: CGO \u201907, pp. 34\u201348 (2007)","DOI":"10.1109\/CGO.2007.4"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Yoo, R.M., Ni, Y., Welc, A., Saha, B., Adl-Tabatabai, A.-R., Lee, H.-H.S.: Kicking the tires of software transactional memory: why the going gets tough. In: SPAA \u201908, pp. 265\u2013274 (2008)","DOI":"10.1145\/1378533.1378582"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:52Z","timestamp":1606185592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}