{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T21:16:40Z","timestamp":1766351800542},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Micro"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/mm.2018.032271064","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T19:18:15Z","timestamp":1526066295000},"page":"79-85","source":"Crossref","is-referenced-by-count":2,"title":["A General Methodology on Designing Acyclic Channel Dependency Graphs in Interconnection Networks"],"prefix":"10.1109","volume":"38","author":[{"given":"Masoumeh","family":"Ebrahimi","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Daneshtalab","sequence":"additional","affiliation":[{"name":"Mälardalen University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/71.250114"},{"key":"ref3","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"36","author":"dally","year":"1987","journal-title":"IEEE Transactions on Computers"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.1991.1021605"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3140659.3080253"},{"key":"ref11","article-title":"Elevator-First: A Deadlock-Free Distributed Routing Algorithm for Vertically Partially Connected 3D-NoCs","author":"dubois","year":"2011","journal-title":"IEEE Transactions on Computers"},{"key":"ref5","article-title":"The turn model for adaptive routing","author":"glass","year":"0","journal-title":"Proceedings of the 19th annual international symposium on Computer architecture  - ISCA '92"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2532871"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2489216"},{"key":"ref2","author":"duato","year":"2002","journal-title":"Interconnection Networks An Engineering Approach"},{"key":"ref9","article-title":"The odd-even turn model for adaptive routing","author":"chiu","year":"2000","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"ref1","author":"dally","year":"2003","journal-title":"Principles and Practices of Interconnection Networks"}],"container-title":["IEEE Micro"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/40\/8357988\/08358045.pdf?arnumber=8358045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T19:54:15Z","timestamp":1651694055000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8358045\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":11,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/mm.2018.032271064","relation":{},"ISSN":["0272-1732","1937-4143"],"issn-type":[{"value":"0272-1732","type":"print"},{"value":"1937-4143","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}