摘要
研究高效易于硬件实现的队列调度算法的目的是为了提高交换系统吞吐率和降低延迟。在阐述输入排队、HOL阻塞、虚拟输出队列等概念的基础上,对MSM、PIM、RRM、iSLIP等调度算法进行了系统的比较,研究表明iSLIP算法是一种性能良好、实现简单的算法。
The purpose to research the scheduling input-queue algorithms of this paper is to obtain a high throughput and low time-delay of the exchanging system Based on the expatiation to some conceptions such as input-queue, head-of-line (HOL) block, virtual-output-queue(VOQ), several scheduling algorithms are compared like maximum size matching(MSM), parallel iterative matching(PIM), round-robin-matching(RRM), iterative round-robin in matching with slip (iSLIP). The results show that the iSLIP algorithm is easy to be implemented with good performance
出处
《安徽理工大学学报（自然科学版）》
CAS
2005年第1期43-47,共5页
Journal of Anhui University of Science and Technology:Natural Science
基金
国家863计划课题资助项目(2003AA115130)
关键词
交换阵列
最大匹配算法
并行迭代匹配算法
滑动轮询匹配算法
滑动迭代轮询匹配算法
crossbar
maximum size matching
parallel iterative matching
round-robin matching algorithm
iterative round-robin in matching with slip(iSLIP)
