{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:18Z","timestamp":1750221318298,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"12","license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2017,11,27]]},"abstract":"<jats:p>Because of the high cost of communication between processors, compilers that parallelize loops automatically have been forced to skip a large class of loops that are both critical to performance and rich in latent parallelism. HELIX-RC is a compiler\/microprocessor co-design that opens those loops to parallelization by decoupling communication from thread execution in conventional multicore architecures. Simulations of HELIX-RC, applied to a processor with 16 Intel Atom-like cores, show an average of 6.85\u00d7 performance speedup for six SPEC CINT2000 benchmarks.<\/jats:p>","DOI":"10.1145\/3139461","type":"journal-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T13:21:34Z","timestamp":1511875294000},"page":"88-97","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatically accelerating non-numerical programs by architecture-compiler co-design"],"prefix":"10.1145","volume":"60","author":[{"given":"Simone","family":"Campanoni","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Brownell","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svilen","family":"Kanev","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy M.","family":"Jones","sequence":"additional","affiliation":[{"name":"University of Cambridge, England"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gu-Yeon","family":"Wei","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Brooks","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1816000"},{"key":"e_1_2_1_2_1","volume-title":"iWarp: An integrated solution to high-speed parallel computing. Supercomputing","author":"Borkar S.","year":"1988","unstructured":"Borkar , S. , Cohn , R. , Cox , G. , Gleason , S. , Gross , T. , Kung , H.T. , Lam , M. , Moore , B. , Peterson , C. , Pieper , J. , Rankin , L. , Tseng , P.S. , Sutton , J. , Urbanski , J. , Webb , J. iWarp: An integrated solution to high-speed parallel computing. Supercomputing ( 1988 ). Borkar, S., Cohn, R., Cox, G., Gleason, S., Gross, T., Kung, H.T., Lam, M., Moore, B., Peterson, C., Pieper, J., Rankin, L., Tseng, P.S., Sutton, J., Urbanski, J., Webb, J. iWarp: An integrated solution to high-speed parallel computing. Supercomputing (1988)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v40:2"},{"key":"e_1_2_1_4_1","volume-title":"ISCA","author":"Campanoni S.","year":"2014","unstructured":"Campanoni , S. , Brownell , K. , Kanev , S. , Jones , T.M. , Wei , G.-Y. , Brooks , D. HELIX-RC: An architecture-compiler co-design for automatic parallelization of irregular programs . In ISCA ( 2014 ). Campanoni, S., Brownell, K., Kanev, S., Jones, T.M., Wei, G.-Y., Brooks, D. HELIX-RC: An architecture-compiler co-design for automatic parallelization of irregular programs. In ISCA (2014)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2259016.2259028"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.13"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.848474"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772973"},{"key":"e_1_2_1_9_1","volume-title":"Morgan & Claypool","author":"Jerger N.E.","year":"2009","unstructured":"Jerger N.E. , Peh , L.-S. On-Chip Networks . Synthesis Lectures on Computer Architecture . Morgan & Claypool , 2009 . Jerger N.E., Peh, L.-S. On-Chip Networks. Synthesis Lectures on Computer Architecture. Morgan & Claypool, 2009."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1122997"},{"key":"e_1_2_1_11_1","unstructured":"Martin M.M.K. Token Coherence. PhD thesis University of Wisconsin-Madison 2003.  Martin M.M.K. Token Coherence. PhD thesis University of Wisconsin-Madison 2003."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237140"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2005.13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400112.1400113"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2013.6522341"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/980152.980156"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237144"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360617"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.224451"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082471"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2002.997877"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.24"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542496"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1945023.1945033"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2007.89"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3139461","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3139461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:50Z","timestamp":1750212830000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3139461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017,11,27]]}},"alternative-id":["10.1145\/3139461"],"URL":"https:\/\/doi.org\/10.1145\/3139461","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2017,11,27]]},"assertion":[{"value":"2017-11-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}