Jianfei Zhang, Zhiyi Fang, Hyung Jae Chang, S. Zheng
{"title":"基于令牌的高级IMOTS(N)交换架构调度算法","authors":"Jianfei Zhang, Zhiyi Fang, Hyung Jae Chang, S. Zheng","doi":"10.1109/SNPD.2012.133","DOIUrl":null,"url":null,"abstract":"In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture\",\"authors\":\"Jianfei Zhang, Zhiyi Fang, Hyung Jae Chang, S. Zheng\",\"doi\":\"10.1109/SNPD.2012.133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.\",\"PeriodicalId\":387936,\"journal\":{\"name\":\"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2012.133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2012.133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture
In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.