{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:09Z","timestamp":1750219809564,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,12,26]],"date-time":"2016-12-26T00:00:00Z","timestamp":1482710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF's Directorate for Computer 8 Information Science 8 Engineering"},{"name":"Software and Hardware Foundations"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2017,4,30]]},"abstract":"<jats:p>\n            With the emergence of many-core multiprocessor system-on-chips (MPSoCs), on-chip networks are facing serious challenges in providing fast communication among various tasks and cores. One promising on-chip network design approach shown in recent studies is to add express channels to traditional mesh network as shortcuts to bypass intermediate routers, thereby reducing packet latency. This approach not only changes the packet latency models, but also greatly affects network traffic behaviors, both of which have not been fully exploited in existing mapping algorithms. In this article, we explore the opportunities in optimizing application mapping for flattened butterfly, a popular express channel-based on-chip network. Specifically, we identify the unique characteristics of flattened butterfly, analyze the opportunities and new challenges, and propose an efficient heuristic mapping algorithm. The proposed algorithm\n            <jats:italic>Contention-Aware Latency Minimal (CALM)<\/jats:italic>\n            is able to reduce unnecessary turns that would otherwise impose additional router pipeline latency to packets, as well as adjust forwarding traffic to reduce network contention latency. Simulation results show that the proposed algorithm can achieve, on average, 3.4X reduction in the number of turns, 24.8% reduction in contention latency, and 14.12% reduction in the overall packet latency.\n          <\/jats:p>","DOI":"10.1145\/2950045","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T13:51:31Z","timestamp":1482846691000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["CALM"],"prefix":"10.1145","volume":"22","author":[{"given":"Di","family":"Zhu","sequence":"first","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyu","family":"Yue","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massoud","family":"Pedram","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhong","family":"Chen","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,12,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555810"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1816004"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919636"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183430"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999946.1999972"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2111270"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_22"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391628"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228480"},{"key":"e_1_2_1_10_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms. 2. MIT press Cambridge.  T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms. 2. MIT press Cambridge."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/278241.278309"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391664"},{"key":"e_1_2_1_13_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman San Francisco CA.  M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman San Francisco CA."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2009.4798251"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2010.5434077"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119818"},{"key":"e_1_2_1_17_1","article-title":"A3MAP: Architecture-aware analytic mapping for networks-on-chip","volume":"17","author":"Jang W.","year":"2012","journal-title":"ACM Trans. Des. Automat. Electron. Syst. (TODAES)"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2007.29"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250681"},{"volume-title":"Proceedings of Euromicro Symposium in Digital Systems Design. 180--187","author":"Lei T.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2004.1269002"},{"key":"e_1_2_1_24_1","first-page":"693","article-title":"It s a small world after all: NoC performance optimization via long-range link insertion. In Proceedings of the IEEE Trans. Very Large Scale Integration (TVLSI) System -- Special Section Hardware\/Software Codesign Syst","volume":"14","author":"Ogras U. Y.","year":"2006","journal-title":"Synthesis"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2007.364440"},{"volume-title":"Proceedings of the IEEE International Solid-State Circuits Conference (ISSCC). 56--57","year":"2013","author":"Ou P.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228431"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2012.10.004"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2013.2240708"},{"volume-title":"Proceedings of the 6th IEEE\/ACM International Symposium in Networks-on-Chip (NOCS). 201--210","author":"Sun C.","key":"e_1_2_1_30_1"},{"volume-title":"Proceedings of the IEEE\/ACM Design, Automation and Test in Europe (DATE). 1--6.","author":"Zhu D.","key":"e_1_2_1_31_1"},{"volume-title":"Proceedings of the IEEE\/ACM Design, Automation and Test in Europe (DATE). 1241--1244","author":"Zhu D.","key":"e_1_2_1_32_1"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2950045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2950045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:49:55Z","timestamp":1750218595000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2950045"}},"subtitle":["Contention-Aware Latency-Minimal Application Mapping for Flattened Butterfly On-Chip Networks"],"short-title":[],"issued":{"date-parts":[[2016,12,26]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4,30]]}},"alternative-id":["10.1145\/2950045"],"URL":"https:\/\/doi.org\/10.1145\/2950045","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2016,12,26]]},"assertion":[{"value":"2015-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}