{"title":"虫洞路由网络中基于轨迹的无死锁路由方案","authors":"Jie Wu","doi":"10.1109/SOUTHC.1995.516118","DOIUrl":null,"url":null,"abstract":"This paper focuses on deadlock-free routing in wormhole-routed networks. A trail-based model is proposed to support deadlock-free routing in any networks with node degree no less than four. Basically, given a graph G representing an interconnection network, a walk in G is a finite sequence of edges. The trail-based model generalizes the trip-based model proposed earlier and it eliminates the need for virtual channels. Fundamentals of this model, including the necessary and sufficient condition of constructing a special trail for deadlock-free routing are investigated. The potential of this model is illustrated by applying it to meshes and hypercubes.","PeriodicalId":341055,"journal":{"name":"Proceedings of Southcon '95","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A trail-based deadlock-free routing scheme in wormhole-routed networks\",\"authors\":\"Jie Wu\",\"doi\":\"10.1109/SOUTHC.1995.516118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on deadlock-free routing in wormhole-routed networks. A trail-based model is proposed to support deadlock-free routing in any networks with node degree no less than four. Basically, given a graph G representing an interconnection network, a walk in G is a finite sequence of edges. The trail-based model generalizes the trip-based model proposed earlier and it eliminates the need for virtual channels. Fundamentals of this model, including the necessary and sufficient condition of constructing a special trail for deadlock-free routing are investigated. The potential of this model is illustrated by applying it to meshes and hypercubes.\",\"PeriodicalId\":341055,\"journal\":{\"name\":\"Proceedings of Southcon '95\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Southcon '95\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOUTHC.1995.516118\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Southcon '95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOUTHC.1995.516118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A trail-based deadlock-free routing scheme in wormhole-routed networks
This paper focuses on deadlock-free routing in wormhole-routed networks. A trail-based model is proposed to support deadlock-free routing in any networks with node degree no less than four. Basically, given a graph G representing an interconnection network, a walk in G is a finite sequence of edges. The trail-based model generalizes the trip-based model proposed earlier and it eliminates the need for virtual channels. Fundamentals of this model, including the necessary and sufficient condition of constructing a special trail for deadlock-free routing are investigated. The potential of this model is illustrated by applying it to meshes and hypercubes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
