{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:32Z","timestamp":1772163992681,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,2,14]],"date-time":"2009-02-14T00:00:00Z","timestamp":1234569600000},"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":[],"published-print":{"date-parts":[[2009,2,14]]},"DOI":"10.1145\/1504176.1504182","type":"proceedings-article","created":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T08:22:24Z","timestamp":1234858944000},"page":"15-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs"],"prefix":"10.1145","author":[{"given":"Seunghwa","family":"Kang","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Bader","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,2,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.41"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.06.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250667"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 4th Ann. Workshop on Duplicating, Deconstructing, and Debunking (WDDD)","author":"Blundell C.","year":"2005","unstructured":"C. Blundell , E. C. Lewis , and M. M. K. Martin . Deconstructing transactional semantics: The subtleties of atomicity . In Proc. 4th Ann. Workshop on Duplicating, Deconstructing, and Debunking (WDDD) , Madison, WI , Jun. 2005 . C. Blundell, E. C. Lewis, and M. M. K. Martin. Deconstructing transactional semantics: The subtleties of atomicity. In Proc. 4th Ann. Workshop on Duplicating, Deconstructing, and Debunking (WDDD), Madison, WI, Jun. 2005."},{"key":"e_1_3_2_1_7_1","volume-title":"In Proc. Workshop on Transactional Memory Workloads (WTW)","author":"Chung J.","year":"2006","unstructured":"J. Chung , C. C. Minh , B. D. Carlstrom , and C. Kozyrakis . Parallelizing SPECjbb2000 with transactional memory . In In Proc. Workshop on Transactional Memory Workloads (WTW) , Ottawa, Canada , Jun. 2006 . J. Chung, C. C. Minh, B. D. Carlstrom, and C. Kozyrakis. Parallelizing SPECjbb2000 with transactional memory. In In Proc. Workshop on Transactional Memory Workloads (WTW), Ottawa, Canada, Jun. 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168900"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. 3rd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)","author":"Dice D.","year":"2008","unstructured":"D. Dice , M. Herlihy , D. Lea , Y. Lev , V. Luchangco , W. Mesard , M. Moir , K. Moore , and D. Nussbaum . Applications of the adaptive transactional memory test platform . In Proc. 3rd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT) , Salt Lake City, UT , Feb. 2008 . D. Dice, M. Herlihy, D. Lea, Y. Lev, V. Luchangco, W. Mesard, M. Moir, K. Moore, and D. Nussbaum. Applications of the adaptive transactional memory test platform. In Proc. 3rd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), Salt Lake City, UT, Feb. 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273029"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/998680.1006711"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346311"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_26"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/204865.204889"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. 11th IEEE Int'l Symp. on Workload Characterization (IISWC)","author":"Minh C. C.","year":"2008","unstructured":"C. C. Minh , J. Chung , C. Kozyrakis , and K. Olukotun . STAMP: Stanford transactional applications for multi-processing . In Proc. 11th IEEE Int'l Symp. on Workload Characterization (IISWC) , Seattle, WA , Sep. 2008 . C. C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford transactional applications for multi-processing. In Proc. 11th IEEE Int'l Symp. on Workload Characterization (IISWC), Seattle, WA, Sep. 2008."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250673"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2006.1598134"},{"key":"e_1_3_2_1_22_1","first-page":"99","volume-title":"DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics 15","author":"Moret B. M. E.","year":"1994","unstructured":"B. M. E. Moret and H. D. Shapiro . An empirical assessment of algorithms for constructing a minimal spanning tree . In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics 15 , pages 99 -- 117 . American Mathematical Society , 1994 . B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimal spanning tree. In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics 15, pages 99--117. American Mathematical Society, 1994."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366230.1366241"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.54"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2007.4362186"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250676"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2008.4523067"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. 5th Int'l Conf. on High-Performance Computer Architecture (HPCA)","author":"Vijaykumar T.","year":"1998","unstructured":"T. Vijaykumar , S. Gopal , J. E. Smith , and G. Sohi . Speculative versioning cache . In Proc. 5th Int'l Conf. on High-Performance Computer Architecture (HPCA) , Las Vegas, NV , Jan. 1998 . T. Vijaykumar, S. Gopal, J. E. Smith, and G. Sohi. Speculative versioning cache. In Proc. 5th Int'l Conf. on High-Performance Computer Architecture (HPCA), Las Vegas, NV, Jan. 1998."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345234"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299062"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/822079.822731"}],"event":{"name":"PPoPP09: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Raleigh NC USA","acronym":"PPoPP09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1504176.1504182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1504176.1504182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:30:08Z","timestamp":1750239008000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1504176.1504182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,14]]},"references-count":30,"alternative-id":["10.1145\/1504176.1504182","10.1145\/1504176"],"URL":"https:\/\/doi.org\/10.1145\/1504176.1504182","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1594835.1504182","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,2,14]]},"assertion":[{"value":"2009-02-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}