首页 | 本学科首页   官方微博 | 高级检索  
     

支持多优先级分组交换调度算法研究及其调度器设计
引用本文:刘化君,刘斌.支持多优先级分组交换调度算法研究及其调度器设计[J].计算机工程与应用,2002,38(14):92-94,97.
作者姓名:刘化君  刘斌
作者单位:1. 临沂师范学院计算机科学与技术系,山东,276005
2. 清华大学计算机科学与技术系,北京,100084
基金项目:国家自然科学基金课题(编号:60173009),清华大学985项目资助
摘    要:输入缓存交换结构的特点是缓存器和交换结构的运行速率与端口速率相等、实现容易,但存在队头阻塞。如果采用虚拟输出排队方法和适当的分组调度算法可予以消除,使吞吐率达到100%。文章首先研究讨论了并行迭代匹配算法,滑动迭代匹配调度算法的基本原理、迭代仲裁步骤及其硬件实现;对高速分组交换调度算法的性能进行了分析比较。然后给出了在高速输入队列交换机中实现多优先级调度算法的调度器设计与实现方案。经设计实现证明高速分组交换调度算法不仅硬件实现简单,而且具有良好的特性。

关 键 词:交换结构  迭代匹配  调度算法  调度器  仲裁器
文章编号:1002-8331-(2002)14-0092-03

Research of Scheduling Algorithms for Supporting Multiple Priorities Packet Switch and Its Scheduler Design
Liu Huajun,Liu Bin.Research of Scheduling Algorithms for Supporting Multiple Priorities Packet Switch and Its Scheduler Design[J].Computer Engineering and Applications,2002,38(14):92-94,97.
Authors:Liu Huajun  Liu Bin
Affiliation:Liu Huajun 1 Liu Bin 21
Abstract: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.
Keywords:Switching fabric  Iterative matching  scheduling algorithm  Scheduler  Arbiter  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号