支持多优先级分组交换调度算法研究及其调度器设计  

Research of Scheduling Algorithms for Supporting Multiple Priorities Packet Switch and Its Scheduler Design

作　　者：刘化君[1] 刘斌[2] 

机构地区：[1]临沂师范学院计算机科学与技术系,山东276005 [2]清华大学计算机科学与技术系,北京100084

出　　处：《计算机工程与应用》2002年第14期92-94,97,共4页Computer Engineering and Applications

基　　金：国家自然科学基金课题(编号:60173009);清华大学985项目资助

摘　　要：输入缓存交换结构的特点是缓存器和交换结构的运行速率与端口速率相等、实现容易,但存在队头阻塞。如果采用虚拟输出排队方法和适当的分组调度算法可予以消除,使吞吐率达到100%。文章首先研究讨论了并行迭代匹配算法,滑动迭代匹配调度算法的基本原理、迭代仲裁步骤及其硬件实现;对高速分组交换调度算法的性能进行了分析比较。然后给出了在高速输入队列交换机中实现多优先级调度算法的调度器设计与实现方案。经设计实现证明高速分组交换调度算法不仅硬件实现简单,而且具有良好的特性。Input queue packets switch has the advantage of same bandwidth of buffer and switching architecture as that of inputs and outputs.But the head of line blocking in input queued switch limits its throughput.If VOQ queuing policies are used with some packet scheduling algorithms ,the100%throughput can be achieved.In this paper,the au-thors firstly discuss that the PIM(parallel iterative matching)algorithm.They introduce the principle of iSLIP(iterative round-robin matching with slip)scheduling algorithm,step arbitration of iSLIP for one iteration and its implementation in hardware,and analysis of iSLIP algorithm performance is made.They describe the design and implementation scheme of an arbiter for configuring crossbar in input-queued switches that supporting multiple priorities.The design scheme shows its easiness to be implemented and good performance in the end of paper.

关 键 词：多优先级分组交换调度算法 调度器 设计 仲裁器 计算机网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]