{"title":"FPGA implementation of the MMRRS scheduling algorithm for VOQ switches","authors":"W. Kabaciński, A. Baranowska, Lukasz Rubik","doi":"10.1109/NETWKS.2010.5624954","DOIUrl":null,"url":null,"abstract":"In this article, a FPGA implementation of the Maximal Matching with Round-Robin Selection (MMRRS) scheduling algorithm for Virtual Output Queuing (VOQ) switches is presented. Implementation is done in the VERILOG hardware description language. The results results obtained from the software model simulation and hardware implementation in XILINX Virtex 5 proved that the implementation is correct. The greatest achievement is the optimization of the scheduler, with the time needed for decision - taking being three clock cycles independent of switch size. The simplicity of the MMRRS algorithm makes the scheduler a simple structure which is not complicated to implement.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624954","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this article, a FPGA implementation of the Maximal Matching with Round-Robin Selection (MMRRS) scheduling algorithm for Virtual Output Queuing (VOQ) switches is presented. Implementation is done in the VERILOG hardware description language. The results results obtained from the software model simulation and hardware implementation in XILINX Virtex 5 proved that the implementation is correct. The greatest achievement is the optimization of the scheduler, with the time needed for decision - taking being three clock cycles independent of switch size. The simplicity of the MMRRS algorithm makes the scheduler a simple structure which is not complicated to implement.