{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T14:40:05Z","timestamp":1740753605657,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_26","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"348-363","source":"Crossref","is-referenced-by-count":6,"title":["A Competitive Analysis for Balanced Transactional Memory Workloads"],"prefix":"10.1007","author":[{"given":"Gokarna","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-540-92990-1_3","volume-title":"High Performance Embedded Architectures and Compilers","author":"M. Ansari","year":"2009","unstructured":"Ansari, M., Luj\u00e1n, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, I.: Steal-on-abort: Improving transactional memory performance through dynamic transaction reordering. In: Seznec, A., Emer, J., O\u2019Boyle, M., Martonosi, M., Ungerer, T. (eds.) HiPEAC 2009. LNCS, vol.\u00a05409, pp. 4\u201318. Springer, Heidelberg (2009)"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s00453-008-9195-x","volume":"57","author":"H. Attiya","year":"2010","unstructured":"Attiya, H., Epstein, L., Shachnai, H., Tamir, T.: Transactional contention management as a non-clairvoyant scheduling problem. Algorithmica\u00a057(1), 44\u201361 (2010)","journal-title":"Algorithmica"},{"key":"26_CR3","first-page":"3","volume-title":"OPODIS 2009","author":"H. Attiya","year":"2009","unstructured":"Attiya, H., Milani, A.: Transactional scheduling for read-dominated workloads. In: OPODIS 2009, pp. 3\u201317. Springer, Heidelberg (2009)"},{"key":"26_CR4","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)"},{"doi-asserted-by":"crossref","unstructured":"Dolev, S., Hendler, D., Suissa, A.: CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. In: PODC 2008, pp. 125\u2013134 (2008)","key":"26_CR5","DOI":"10.1145\/1400751.1400769"},{"doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Guerraoui, R., Singh, A.V., Singh, V.: Preventing versus curing: avoiding conflicts in transactional memories. In: PODC 2009, pp. 7\u201316 (2009)","key":"26_CR6","DOI":"10.1145\/1582716.1582725"},{"doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: CCC 1996, pp. 278\u2013287 (1996)","key":"26_CR7","DOI":"10.1109\/CCC.1996.507690"},{"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)","key":"26_CR8","DOI":"10.1145\/1345206.1345241"},{"key":"26_CR9","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"unstructured":"Guerraoui, R., Herlihy, M., Kapalka, M., Pochon, B.: Robust Contention Management in Software Transactional Memory. In: SCOOL 2005 (2005)","key":"26_CR10"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: PODC 2005, pp. 258\u2013264 (2005)","key":"26_CR11","DOI":"10.1145\/1073814.1073863"},{"key":"26_CR12","first-page":"388","volume-title":"OOPSLA 2003","author":"T. Harris","year":"2003","unstructured":"Harris, T., Fraser, K.: Language support for lightweight transactions. In: OOPSLA 2003, pp. 388\u2013402. ACM, New York (2003)"},{"doi-asserted-by":"crossref","unstructured":"Harris, T., Marlow, S., Peyton-Jones, S., Herlihy, M.: Composable memory transactions. In: PPoPP 2005, pp. 48\u201360 (2005)","key":"26_CR13","DOI":"10.1145\/1065944.1065952"},{"unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS 2003, pp. 522\u2013529 (2003)","key":"26_CR14"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, I.W.N.: Software transactional memory for dynamic-sized data structures. In: PODC 2003, pp. 92\u2013101 (2003)","key":"26_CR15","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: ISCA 1993, pp. 289\u2013300 (1993)","key":"26_CR16","DOI":"10.1145\/173682.165164"},{"doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: FOCS 2001, pp. 600\u2013609 (2001)","key":"26_CR17","DOI":"10.1109\/SFCS.2001.959936"},{"unstructured":"Marathe, V.J., Spear, M.F., Heriot, C., Acharya, A., Eisenstat, D., Scherer III, W.N., Scott, M.L.: Lowering the overhead of software transactional memory. Tech. Rep. TR 893, Computer Science Department, University of Rochester (2006)","key":"26_CR18"},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MM.2008.10","volume":"28","author":"H.E. Ramadan","year":"2008","unstructured":"Ramadan, H.E., Rossbach, C.J., Porter, D.E., Hofmann, O.S., Bhandari, A., Witchel, E.: Metatm\/txlinux: Transactional memory for an operating system. IEEE Micro.\u00a028(1), 42\u201351 (2008)","journal-title":"IEEE Micro."},{"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)","key":"26_CR20","DOI":"10.1145\/1073814.1073861"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-10631-6_46","volume-title":"Algorithms and Computation","author":"J. Schneider","year":"2009","unstructured":"Schneider, J., Wattenhofer, R.: Bounds on contention management algorithms. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 441\u2013451. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Sharma, G., Busch, C.: A competitive analysis for balanced transactional memory workloads. CoRR abs\/1009.0056 (2010)","key":"26_CR22","DOI":"10.1007\/978-3-642-17653-1_26"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-15763-9_7","volume-title":"Distributed Computing","author":"G. Sharma","year":"2010","unstructured":"Sharma, G., Estrade, B., Busch, C.: Window-based greedy contention management for transactional memory. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 64\u201378. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC 1995, pp. 204\u2013213 (1995)","key":"26_CR24","DOI":"10.1145\/224964.224987"},{"doi-asserted-by":"crossref","unstructured":"Yoo, R.M., Lee, H.H.S.: Adaptive transaction scheduling for transactional memory systems. In: SPAA 2008, pp. 169\u2013178 (2008)","key":"26_CR25","DOI":"10.1145\/1378533.1378564"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T13:34:11Z","timestamp":1740749651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}