{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:37Z","timestamp":1750307917035,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2007,3]]},"abstract":"<jats:p>In transactional memory systems like TCC, unordered transactions are committed on a first-come, first-serve basis. If a transaction has read data that has been modified by the next transaction to commit, it will have to roll-back and a lot of computations can potentially be wasted. Even worse, such simple commit arbitration policies are prone to starvation; in fact, the performance of Raytrace in SPLASH-2 suffered significantly because of this.<\/jats:p>\n          <jats:p>This paper analyzes in detail the design issues for commit arbitration policies and proposes novel policies that reduce the amount of wasted computation due to roll-back and, most importantly, avoid starvation. We analyze in detail how to incorporate them in a TCC-like transactional memory protocol. We find that our proposed schemes have no impact on the common-case performance. In addition, they add modest complexity to the baseline protocol.<\/jats:p>","DOI":"10.1145\/1241601.1241610","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:16Z","timestamp":1181140636000},"page":"39-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Starvation-free commit arbitration policies for transactional memory systems"],"prefix":"10.1145","volume":"35","author":[{"given":"M. M.","family":"Waliullah","sequence":"first","affiliation":[{"name":"Chalmers University of Technology, Goteborg, Sweden"}]},{"given":"Per","family":"Stenstrom","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Goteborg, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2007,3]]},"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.5555\/998680.1006711"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_2_1_4_1","unstructured":"K. E. Moore J. Bobba M. J. Moravan M. D. Hill and D. A. Wood \"LogTM: Log-based Transactional Memory\" In Proceedings of the 12th Annual International Symposium on High Performance Computer Architecture TX February 11--15 2006.  K. E. Moore J. Bobba M. J. Moravan M. D. Hill and D. A. Wood \"LogTM: Log-based Transactional Memory\" In Proceedings of the 12th Annual International Symposium on High Performance Computer Architecture TX February 11--15 2006."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.982916"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605400"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.54"},{"volume-title":"IEEE Computer Society","year":"2001","author":"Rajwar R.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605399"},{"key":"e_1_2_1_10_1","unstructured":"P. Rundberg and P. Stenstrom \"Reordered speculative execution of critical sections.\" In Proceedings of the 2002 International Conference on Parallel Processing February 2002.  P. Rundberg and P. Stenstrom \"Reordered speculative execution of critical sections.\" In Proceedings of the 2002 International Conference on Parallel Processing February 2002."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.223990"}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1241601.1241610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1241601.1241610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:26Z","timestamp":1750258286000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1241601.1241610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["10.1145\/1241601.1241610"],"URL":"https:\/\/doi.org\/10.1145\/1241601.1241610","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2007,3]]},"assertion":[{"value":"2007-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}