{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:34:41Z","timestamp":1761323681090,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60873112"],"award-info":[{"award-number":["60873112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS-0702168"],"award-info":[{"award-number":["ECCS-0702168"]}],"id":[{"id":"10.13039\/100000148","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":[[2010,4]]},"abstract":"<jats:p>In this article, we investigate the Intellectual Property (IP) mapping problem that maps a given set of IP cores onto the tiles of a mesh-based Network-on-Chip (NoC) architecture such that the power consumption due to intercore communications is minimized. This IP mapping problem is considered under both bandwidth and latency constraints as imposed by the applications and the on-chip network infrastructure. By examining various applications' communication characteristics extracted from their respective communication trace graphs, two distinguishable connectivity templates are realized: the graphs with tightly coupled vertices and those with distributed vertices. These two templates are formally defined in this article, and different mapping heuristics are subsequently developed to map them. In general, tightly coupled vertices are mapped onto tiles that are physically close to each other while the distributed vertices are mapped following a graph partition scheme. Experimental results on both random and multimedia benchmarks have confirmed that the proposed template-based mapping algorithm achieves an average of 15% power savings as compared with MOCA, a fast greedy-based mapping algorithm. Compared with a branch-and-bound--based mapping algorithm, which produces near optimal results but incurs an extremely high computation cost, the proposed algorithm, due to its polynomial runtime complexity, can generate the results of almost the same quality with much less CPU time. As the on-chip network size increases, the superiority of the proposed algorithm becomes more evident.<\/jats:p>","DOI":"10.1145\/1736065.1736066","type":"journal-article","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T14:14:06Z","timestamp":1272982446000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A power-aware mapping approach to map IP cores onto NoCs under bandwidth and latency constraints"],"prefix":"10.1145","volume":"7","author":[{"given":"Xiaohang","family":"Wang","sequence":"first","affiliation":[{"name":"Zhejiang University, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Nevada, Las Vegas, Las Vegas, NV"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingtao","family":"Jiang","sequence":"additional","affiliation":[{"name":"University of Nevada, Las Vegas, Las Vegas, NV"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[{"name":"Zhejiang University, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,5,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1068504.1068761"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.22"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.851989"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379048"},{"volume-title":"Proceedings of the 6th International Workshop on Hardware\/Software Co-Design. ACM","author":"Dick R. P.","key":"e_1_2_1_5_1","unstructured":"Dick , R. P. , Rhodes , D. L. , and Wolf , W . 1998. TGFF: Task graphs for free . In Proceedings of the 6th International Workshop on Hardware\/Software Co-Design. ACM , New York, 97--101. Dick, R. P., Rhodes, D. L., and Wolf, W. 1998. TGFF: Task graphs for free. In Proceedings of the 6th International Workshop on Hardware\/Software Co-Design. ACM, New York, 97--101."},{"key":"e_1_2_1_6_1","volume-title":"Interconnection Networks: An Engineering Approach","author":"Duato J.","year":"2003","unstructured":"Duato , J. , Yalamanchili , S. , and Ni , L. M . 2003 . Interconnection Networks: An Engineering Approach . Morgan Kaufmann Publishers , San Francisco, CA . Duato, J., Yalamanchili, S., and Ni, L. M. 2003. Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers, San Francisco, CA."},{"key":"e_1_2_1_7_1","unstructured":"Garey M. R. and Johnson D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness.WH Freeman San Francisco CA.   Garey M. R. and Johnson D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness.WH Freeman San Francisco CA."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1084834.1084857"},{"volume-title":"Proceedings of the Conference on Circuits and Systems and TAISA. IEEE","author":"Harmanani H. M.","key":"e_1_2_1_9_1","unstructured":"Harmanani , H. M. and Farah , R . 2008. A method for efficient mapping and reliable routing for NoC architectures with minimum bandwidth and area . In Proceedings of the Conference on Circuits and Systems and TAISA. IEEE , Los Alamitos, CA, 29--32. Harmanani, H. M. and Farah, R. 2008. A method for efficient mapping and reliable routing for NoC architectures with minimum bandwidth and area. In Proceedings of the Conference on Circuits and Systems and TAISA. IEEE, Los Alamitos, CA, 29--32."},{"key":"e_1_2_1_10_1","unstructured":"Hendrickson B. and Leland R. 1995. The Chaco User's Guide: Version 2.0. Sandia National Laboratories Albuquerque NM.  Hendrickson B. and Leland R. 1995. The Chaco User's Guide: Version 2.0. Sandia National Laboratories Albuquerque NM."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.920580"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119818"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.844106"},{"key":"e_1_2_1_14_1","unstructured":"ITRS. 2007. International technology roadmap for semiconductors. http:\/\/www.itrs.net\/Links\/2007ITRS\/Home2007.htm.  ITRS. 2007. International technology roadmap for semiconductors. http:\/\/www.itrs.net\/Links\/2007ITRS\/Home2007.htm."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jantsch A. and Tenhunen H. 2003. Networks on Chip. Kluwer Academic Publishers New York.   Jantsch A. and Tenhunen H. 2003. Networks on Chip. Kluwer Academic Publishers New York.","DOI":"10.1007\/b105353"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.77"},{"key":"e_1_2_1_17_1","first-page":"425","article-title":"A low energy mapping and routing approach for network on chip with QoS guarantees","volume":"20","author":"Lin H.","year":"2008","unstructured":"Lin , H. , Li , X. , Tong , D. and Cheng , X. 2008 . A low energy mapping and routing approach for network on chip with QoS guarantees . J. Comput. Aid. Des. Comput. Graphics. 20 , 4, 425 -- 431 . Lin, H., Li, X., Tong, D. and Cheng, X. 2008. A low energy mapping and routing approach for network on chip with QoS guarantees. J. Comput. Aid. Des. Comput. Graphics. 20, 4, 425--431.","journal-title":"J. Comput. Aid. Des. Comput. Graphics."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2008.4538763"},{"volume-title":"Proceedings of the IEEE International Symposium on Circuits and Systems. IEEE","author":"Marcon C. A. M.","key":"e_1_2_1_19_1","unstructured":"Marcon , C. A. M. , Moreno , E. I. , Calazans , N. L. V. and Moraes , F. G . 2007. Evaluation of algorithms for low energy mapping onto NoCs . In Proceedings of the IEEE International Symposium on Circuits and Systems. IEEE , Los Alamitos, CA, 389--392. Marcon, C. A. M., Moreno, E. I., Calazans, N. L. V. and Moraes, F. G. 2007. Evaluation of algorithms for low energy mapping onto NoCs. In Proceedings of the IEEE International Symposium on Circuits and Systems. IEEE, Los Alamitos, CA, 389--392."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1587\/elex.4.478"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1209464"},{"volume-title":"Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. ACM","author":"Murali S.","key":"e_1_2_1_22_1","unstructured":"Murali , S. and De Micheli, G. 2004. Bandwidth-constrained mapping of cores onto NoC architectures . In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. ACM , New York, 896--901. Murali, S. and De Micheli, G. 2004. Bandwidth-constrained mapping of cores onto NoC architectures. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. ACM, New York, 896--901."},{"key":"e_1_2_1_23_1","unstructured":"Noxim. Network-on-chip simulator. http:\/\/sourceforge.net\/projects\/noxim  Noxim. Network-on-chip simulator. http:\/\/sourceforge.net\/projects\/noxim"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1084834.1084856"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2013273"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077603.1077695"},{"volume-title":"Proceedings of the 35th Annual International Symposium on Microarchitecture. IEEE","author":"Wang H.","key":"e_1_2_1_27_1","unstructured":"Wang , H. , Zhu , X. , Peh , L-S. , and Malik , S . 2002. Orion: a power-performance simulator for interconnection networks . In Proceedings of the 35th Annual International Symposium on Microarchitecture. IEEE , Los Alamitos, CA, 294--305. Wang, H., Zhu, X., Peh, L-S., and Malik, S. 2002. Orion: a power-performance simulator for interconnection networks. In Proceedings of the 35th Annual International Symposium on Microarchitecture. IEEE, Los Alamitos, CA, 294--305."},{"volume-title":"Proceedings of the Asia Pacific Conference on Circuits and Systems. IEEE","author":"Zhou W.","key":"e_1_2_1_28_1","unstructured":"Zhou , W. , Zhang , Y. , and Mao , Z . 2006. Pareto-based multi-objective mapping IP cores onto NoC architectures . In Proceedings of the Asia Pacific Conference on Circuits and Systems. IEEE , Los Alamitos, CA, 331--334. Zhou, W., Zhang, Y., and Mao, Z. 2006. Pareto-based multi-objective mapping IP cores onto NoC architectures. In Proceedings of the Asia Pacific Conference on Circuits and Systems. IEEE, Los Alamitos, CA, 331--334."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1736065.1736066","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1736065.1736066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:22Z","timestamp":1750250482000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1736065.1736066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["10.1145\/1736065.1736066"],"URL":"https:\/\/doi.org\/10.1145\/1736065.1736066","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2010,4]]},"assertion":[{"value":"2009-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-05-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}