M. Rahman, Y. Inoguchi, Y. Sato, Y. Miura, S. Horiguchi
{"title":"TESH网络的热点流量模式研究","authors":"M. Rahman, Y. Inoguchi, Y. Sato, Y. Miura, S. Horiguchi","doi":"10.1109/ICCITECHN.2008.4802999","DOIUrl":null,"url":null,"abstract":"In this paper, we present a deadlock-free routing algorithm for the Tori connected mESH (TESH) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the networks dynamic communication performance under the hot-spot traffic pattern, using the proposed routing algorithm. We evaluate the dynamic communication performance of TESH, mesh, and torus networks by computer simulation. It is shown that the dynamic communication performance of the TESH network is better than that of the mesh and torus networks. It is also shown that the relative difference in maximum throughput between torus and TESH networks decreases with the increase of hot spot traffic.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On hot-spot traffic pattern of TESH network\",\"authors\":\"M. Rahman, Y. Inoguchi, Y. Sato, Y. Miura, S. Horiguchi\",\"doi\":\"10.1109/ICCITECHN.2008.4802999\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a deadlock-free routing algorithm for the Tori connected mESH (TESH) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the networks dynamic communication performance under the hot-spot traffic pattern, using the proposed routing algorithm. We evaluate the dynamic communication performance of TESH, mesh, and torus networks by computer simulation. It is shown that the dynamic communication performance of the TESH network is better than that of the mesh and torus networks. It is also shown that the relative difference in maximum throughput between torus and TESH networks decreases with the increase of hot spot traffic.\",\"PeriodicalId\":335795,\"journal\":{\"name\":\"2008 11th International Conference on Computer and Information Technology\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 11th International Conference on Computer and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2008.4802999\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th International Conference on Computer and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2008.4802999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present a deadlock-free routing algorithm for the Tori connected mESH (TESH) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the networks dynamic communication performance under the hot-spot traffic pattern, using the proposed routing algorithm. We evaluate the dynamic communication performance of TESH, mesh, and torus networks by computer simulation. It is shown that the dynamic communication performance of the TESH network is better than that of the mesh and torus networks. It is also shown that the relative difference in maximum throughput between torus and TESH networks decreases with the increase of hot spot traffic.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
