摘要
研究高效易于硬件实现的队列调度算法的目的是为了提高交换系统吞吐率和降低延迟。在阐述输入排队、HOL阻塞、虚拟输出队列等概念的基础上,对MSM、PIM、RRM、iSLIP等调度算法进行了系统的比较,研究表明iSLIP算法是一种性能良好、实现简单的算法。
The purposes of this paper are aimed at high throughput and low time-delay, scheduling with efficient algorithms, at the same time the hardware can easy to be implemented in switching systems. Based on some conceptions such as Input-Queue,head-of-line(HOL) block, Virtual-output-Queue (VOQ)are described and several scheduling algorithms as M aximun size matching (MSM), parallel iterative matehing(PIM) ,Round-robin-matchlng(RRM) ,iterative round-robin in matching with slip (iSLIP)are compared, the results shows that the iSLIP algorithm is easy to be implemented with good performance.
出处
《计算机应用与软件》
CSCD
北大核心
2006年第3期22-24,66,共4页
Computer Applications and Software
基金
国家863计划课题(No.2003AA115130)
关键词
交换阵列
最大匹配算法
并行迭代匹配算法
滑动轮询匹配算法
滑动迭代轮询匹配算法
Corssbar Maximum size matching Parallel iterative matching Round-robin matching algorithm Iterative round-robin in matching with slip (iSLIP)