{"title":"Imptementing priority scheduting in a combined input-crosspoint-output queued switch","authors":"P. Yi, Han Qiu, Binqiang Wang","doi":"10.1109/AINA.2006.197","DOIUrl":null,"url":null,"abstract":"The combined input-crosspoint-queued (CICQ) crossbar switch is very appealing because it can obtain high throughput with simple scheduling mechanisms. However, in order to support multiple priority levels, separate queues per priority are required at each crosspoint, hence there needs much more memories and many priority schedulers to be implemented in a buffered crossbar, which is of great complexity. In this paper we propose a scheme that uses a hierarchical priority queuing mechanism in the input queues and a simple queue per crosspoint to effectively support multiple priorities. We present a priority weighted double round robin (PWDRR) scheduling algorithm in input scheduler to implement bandwidth allocation among multiple priorities and a simple compensation priority round robin (CPRR) scheduling policy in crosspoint scheduler to transfer cells to the output. The simulation results verify a preferable performance of our scheme.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2006.197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The combined input-crosspoint-queued (CICQ) crossbar switch is very appealing because it can obtain high throughput with simple scheduling mechanisms. However, in order to support multiple priority levels, separate queues per priority are required at each crosspoint, hence there needs much more memories and many priority schedulers to be implemented in a buffered crossbar, which is of great complexity. In this paper we propose a scheme that uses a hierarchical priority queuing mechanism in the input queues and a simple queue per crosspoint to effectively support multiple priorities. We present a priority weighted double round robin (PWDRR) scheduling algorithm in input scheduler to implement bandwidth allocation among multiple priorities and a simple compensation priority round robin (CPRR) scheduling policy in crosspoint scheduler to transfer cells to the output. The simulation results verify a preferable performance of our scheme.