{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:54Z","timestamp":1750307214080,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Spanish MEC and MICINN, as well as European Comission FEDER funds","award":["Consolider Ingenio-2010 CSD2006-00046TIN2009-14 475-C04"],"award-info":[{"award-number":["Consolider Ingenio-2010 CSD2006-00046TIN2009-14 475-C04"]}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["Consolider Ingenio-2010 CSD2006-00046TIN2009-14 475-C04"],"award-info":[{"award-number":["Consolider Ingenio-2010 CSD2006-00046TIN2009-14 475-C04"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","doi-asserted-by":"publisher","award":["AP2006-04152"],"award-info":[{"award-number":["AP2006-04152"]}],"id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>\n            In this paper we investigate the benefits of turning the concept of transactional conflict from its traditionally fixed definition into a variable one that can be dynamically controlled in software. We propose the extension of the\n            <jats:italic>atomic<\/jats:italic>\n            language construct with an attribute that specifies the definition of conflict, so that programmers can write code which adjusts what kinds of conflicts are to be detected, relaxing or tightening the conditions according to the forms of interference that can be tolerated by a particular algorithm. Using this performance-motivated construct, specific conflict information can be associated with portions of code, as each transaction is provided with a local definition that applies while it executes. We find that defining conflicts in software makes possible the removal of dependencies which arise as a result of the coarse synchronization style encouraged by the TM programming model. We illustrate the use of the proposed construct in a variety of use cases with real applications, showing how programmers can take advantage of their knowledge about the problem and other global information not available at run-time. We describe how to implement a hardware TM design that utilizes this software construct. Our experiments reveal that leveraging software-defined conflicts, the programmer is able to achieve significant reductions in the number of aborts--over 50% for most applications. At 16 threads, our system with software-defined conflicts outperforms LogTM-SE in nearly all benchmarks, reaching an average reduction in execution time of 18%.\n          <\/jats:p>","DOI":"10.1145\/2086696.2086710","type":"journal-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T16:47:14Z","timestamp":1327423634000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Hardware transactional memory with software-defined conflicts"],"prefix":"10.1145","volume":"8","author":[{"given":"Ruben","family":"Titos-Gil","sequence":"first","affiliation":[{"name":"Universidad de Murcia"}]},{"given":"Manuel E.","family":"Acacio","sequence":"additional","affiliation":[{"name":"Universidad de Murcia"}]},{"given":"Jose M.","family":"Garcia","sequence":"additional","affiliation":[{"name":"Universidad de Murcia"}]},{"given":"Tim","family":"Harris","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Adrian","family":"Cristal","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center"}]},{"given":"Osman","family":"Unsal","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center"}]},{"given":"Ibrahim","family":"Hur","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center"}]},{"given":"Mateo","family":"Valero","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center"}]}],"member":"320","published-online":{"date-parts":[[2012,1,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.41"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250674"},{"volume-title":"Proceedings of the IEEE International. Symposium on Workload Characterization. 35--46","author":"Cao Minh C.","key":"e_1_2_1_3_1","unstructured":"Cao Minh , C. , Chung , J. , Kozyrakis , C. , and Olukotun , K . 2008. STAMP: Stanford transactional applications for multi-processing . In Proceedings of the IEEE International. Symposium on Workload Characterization. 35--46 . Cao Minh, C., Chung, J., Kozyrakis, C., and Olukotun, K. 2008. STAMP: Stanford transactional applications for multi-processing. In Proceedings of the IEEE International. Symposium on Workload Characterization. 35--46."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229441"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"volume-title":"Proceedings of the 31st International Symposium on Computer Architecture. 102--113","author":"Hammond L.","key":"e_1_2_1_6_1","unstructured":"Hammond , L. , Wong , V. , Chen , M. , Carlstrom , B. D. , Davis , J. D. , Hertzberg , B. , Prabhu , M. K. , Wijaya , H. , Kozyrakis , C. , and Olukotun , K . 2004. Transactional memory coherence and consistency . In Proceedings of the 31st International Symposium on Computer Architecture. 102--113 . Hammond, L., Wong, V., Chen, M., Carlstrom, B. D., Davis, J. D., Hertzberg, B., Prabhu, M. K., Wijaya, H., Kozyrakis, C., and Olukotun, K. 2004. Transactional memory coherence and consistency. In Proceedings of the 31st International Symposium on Computer Architecture. 102--113."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_2_1_8_1","unstructured":"Hill M. D. Hower D. Moore K. E. Swift M. M. Volos H. and Wood D. A. 2007. A case for deconstructing hardware transactional memory systems. Tech. rep. Univ. of Wisconsin CS-TR-2007-1594.  Hill M. D. Hower D. Moore K. E. Swift M. M. Volos H. and Wood D. A. 2007. A case for deconstructing hardware transactional memory systems. Tech. rep. Univ. of Wisconsin CS-TR-2007-1594."},{"volume-title":"Proceedings of the 5th Symposium on High-Performance Computer Architecture. 161","author":"Kaxiras S.","key":"e_1_2_1_9_1","unstructured":"Kaxiras , S. and Goodman , J. R . 1999. Improving cc-numa performance using instruction-based prediction . In Proceedings of the 5th Symposium on High-Performance Computer Architecture. 161 . Kaxiras, S. and Goodman, J. R. 1999. Improving cc-numa performance using instruction-based prediction. In Proceedings of the 5th Symposium on High-Performance Computer Architecture. 161."},{"key":"e_1_2_1_10_1","volume-title":"Eds","author":"Kohonen T.","year":"2001","unstructured":"Kohonen , T. , Schroeder , M. R. , and Huang , T. S. , Eds . 2001 . Self-Organizing Maps . Kohonen, T., Schroeder, M. R., and Huang, T. S., Eds. 2001. Self-Organizing Maps."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.982916"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1105734.1105747"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.9"},{"volume-title":"Proceedings of the 12th Symposium on High-Performance Computer Architecture. 254--265","author":"Moore K. E.","key":"e_1_2_1_14_1","unstructured":"Moore , K. E. , Bobba , J. , Moravan , M. J. , Hill , M. D. , and Wood , D. A . 2006. LogTM: Log-based transactional memory . In Proceedings of the 12th Symposium on High-Performance Computer Architecture. 254--265 . Moore, K. E., Bobba, J., Moravan, M. J., Hill, M. D., and Wood, D. A. 2006. LogTM: Log-based transactional memory. In Proceedings of the 12th Symposium on High-Performance Computer Architecture. 254--265."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168902"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229442"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1521747.1521799"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.17"},{"key":"e_1_2_1_19_1","unstructured":"Skare T. and Kozyrakis C. 2006. Early release: Friend or foe&quest; In Proceedings of the Workshop on TM Workloads.  Skare T. and Kozyrakis C. 2006. Early release: Friend or foe&quest; In Proceedings of the Workshop on TM Workloads."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161032"},{"volume-title":"TRANSACT '08: 3rd Workshop on Transactional Computing.","author":"Volos H.","key":"e_1_2_1_21_1","unstructured":"Volos , H. , Goyal , N. , and Swift , M . 2008. Pathological interaction of locks with transactional memory . In TRANSACT '08: 3rd Workshop on Transactional Computing. Volos, H., Goyal, N., and Swift, M. 2008. Pathological interaction of locks with transactional memory. In TRANSACT '08: 3rd Workshop on Transactional Computing."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299062"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.223990"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346204"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2086696.2086710","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2086696.2086710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:42Z","timestamp":1750241202000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2086696.2086710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1145\/2086696.2086710"],"URL":"https:\/\/doi.org\/10.1145\/2086696.2086710","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}