{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:10:50Z","timestamp":1767773450904,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050535"},{"type":"electronic","value":"9783030050542"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05054-2_14","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:33:21Z","timestamp":1544124801000},"page":"187-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["ASA-routing: A-Star Adaptive Routing Algorithm for Network-on-Chips"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3363-6190","authenticated-orcid":false,"given":"Yuan","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"14_CR1","unstructured":"International technology roadmap for semiconductors interconnect. Tech. rep., Semiconductor Industry Assoc. (2006)"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1109\/TC.2008.38","volume":"57","author":"G Ascia","year":"2008","unstructured":"Ascia, G., Catania, V., Palesi, M., Patti, D.: Implementation and analysis of a new selection strategy for adaptive routing in networks-on-chip. IEEE Trans. Comput. 57(6), 809\u2013820 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Boura, Y.M., Das, C.R.: A class of partially adaptive routing algorithms for n\n                      \n                        \n                      \n                      $$\\_$$\n                    dimensional meshes. In: Proceedings of the 1993 International Conference on Parallel Processing, pp. 175\u2013182. CRC Press, NY (1993)","DOI":"10.1109\/ICPP.1993.16"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/6979.994796","volume":"3","author":"I Chabini","year":"2002","unstructured":"Chabini, I., Lan, S.: Adaptations of the a* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Trans. Intell. Transp. Syst. 3(1), 60\u201374 (2002)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"7","key":"14_CR5","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/71.877831","volume":"11","author":"G Chiu","year":"2000","unstructured":"Chiu, G.: The odd-even turn model for adaptive routing. IEEE Trans. Parallel Distrib. Syst. 11(7), 729\u2013738 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Dally, W.J., Towles, B.: Route packets, not wires: on-chip interconnection networks. In: Proceedings of the 38th Design Automation Conference, pp. 684\u2013689. ACM, Las Vegas (2001)","DOI":"10.1145\/378239.379048"},{"key":"14_CR7","volume-title":"Interconnection Networks: An Engineering Approach","author":"J Duato","year":"2003","unstructured":"Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann, San Francisco (2003)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ebrahimi, M., Daneshtalab, M., Liljeberg, P., Plosila, J., Tenhunen, H.: CATRA- congestion aware trapezoid-based routing algorithm for on-chip networks. In: Design, Automation & Test in Europe Conference & Exhibition, DATE, pp. 320\u2013325. IEEE, Dresden (2012)","DOI":"10.1109\/DATE.2012.6176488"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Farahnakian, F., Ebrahimi, M., Daneshtalab, M., Liljeberg, P., Plosila, J.: Q-learning based congestion-aware routing algorithm for on-chip network. In: Proceedings of the 2nd IEEE International Conference on Networked Embedded Systems for Enterprise Applications, NESEA, pp. 1\u20137. IEEE Computer Society, Perth (2011)","DOI":"10.1109\/NESEA.2011.6144949"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Feng, W., Shin, K.G.: Impact of selection functions on routing algorithm performance in multicomputer networks. In: In: Proceedings of the 11th international conference on Supercomputing, pp. 132\u2013139. ACM, Austria (1997)","DOI":"10.1145\/263580.263616"},{"issue":"5","key":"14_CR11","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/185675.185682","volume":"41","author":"CJ Glass","year":"1994","unstructured":"Glass, C.J., Ni, L.M.: The turn model for adaptive routing. J. ACM 41(5), 874\u2013902 (1994)","journal-title":"J. ACM"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Hu, J., Marculescu, R.: Dyad: smart routing for networks-on-chip. In: Proceedings of the 41st Design Automation Conference, pp. 260\u2013263. ACM, San Diego (2004)","DOI":"10.1145\/996566.996638"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Li, M., Zeng, Q., Jone, W.: Dyxy: a proximity congestion-aware deadlock-free dynamic routing method for network on chip. In: Proceedings of the 43rd Design Automation Conference, pp. 849\u2013852. ACM, San Francisco (2006)","DOI":"10.1145\/1146909.1147125"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Lotfi-Kamran, P., Daneshtalab, M., Lucas, C., Navabi, Z.: BARP-A dynamic routing protocol for balanced distribution of traffic in NoCs. In: Design. Automation and Test in Europe, DATE, pp. 1408\u20131413. ACM, Munich (2008)","DOI":"10.1145\/1403375.1403716"},{"key":"14_CR16","first-page":"292","volume-title":"Lecture Notes in Computer Science","author":"J. C. Mart\u00ednez","year":"2000","unstructured":"Mart\u00ednez, J.C., Silla, F., L\u00f3pez, P., Duato, J.: On the influence of the selection function on the performance of networks of workstations. In: Third International Symposium High Performance Computing, ISHPC, pp. 292\u2013299. Springer, Tokyo (2000)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/2.191995","volume":"26","author":"LM Ni","year":"1993","unstructured":"Ni, L.M., McKinley, P.K.: A survey of wormhole routing techniques in direct networks. IEEE Comput. 26(2), 62\u201376 (1993)","journal-title":"IEEE Comput."},{"key":"14_CR18","unstructured":"Rijpkema, E., Goossens, K.G.W., Radulescu, A., Dielissen, J., van Meerbergen, J.L., Wielage, P., Waterlander, E.: Trade offs in the design of a router with both guaranteed and best-effort services for networks on chip. In: Design, Automation and Test in Europe Conference and Exposition (DATE), pp. 10350\u201310355. IEEE Computer Society, Munich (2003)"},{"issue":"7","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1006\/jpdc.2002.1837","volume":"62","author":"L Schwiebert","year":"2002","unstructured":"Schwiebert, L., Bell, R.: Performance tuning of adaptive wormhole routing through selection function choice. J. Parallel Distrib. Comput. 62(7), 1121\u20131141 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1109\/TPDS.2013.184","volume":"26","author":"M Tang","year":"2015","unstructured":"Tang, M., Lin, X., Palesi, M.: Routing pressure: a channel-related and traffic-aware metric of routing algorithm. IEEE Trans. Parallel Distrib. Syst. 26(3), 891\u2013901 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/TC.2016.2564961","volume":"66","author":"M Tang","year":"2017","unstructured":"Tang, M., Lin, X., Palesi, M.: The repetitive turn model for adaptive routing. IEEE Trans. Comput. 66(1), 138\u2013146 (2017)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TDSC.2009.3","volume":"8","author":"D Xiang","year":"2011","unstructured":"Xiang, D.: Deadlock-free adaptive routing in meshes with fault-tolerance ability based on channel overlapping. IEEE Trans. Dependable Sec. Comput. 8(1), 74\u201388 (2011)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-319-27119-4_33","volume-title":"Algorithms and Architectures for Parallel Processing","author":"Zhigang Yu","year":"2015","unstructured":"Yu, Z., Wang, X., Shen, K., Liu, H.: A general methodology to design deadlock-free routing algorithms for mesh networks. In: 15th International Conference on Algorithms and Architectures for Parallel Processing - ICA3PP, pp. 478\u2013491. Springer, Zhangjiajie (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05054-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T05:22:34Z","timestamp":1558329754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05054-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050535","9783030050542"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05054-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}