摘要
在CICQ的两类调度算法中,无队列状态信息调度算法相对简单,但在非均匀的业务流环境下性能无法令人满意;基于队列状态信息的调度算法在非均匀的业务流环境下性能良好,但算法复杂度高。针对以上不足,提出一种低复杂度的高效调度算法CRR-FRR。新算法无需比较和排序,硬件实现简单,具有良好的可扩展性。仿真结果表明,无论是在均匀分布还是在突发业务源的情况下,均具有良好的时延性能。
Between two types of scheduling algorithms used in CICQ, the stateless scheduling algorithm is less complicated, but its performance is degraded under uneven traffic ; while the scheduling algorithm based on queue state information shows high performance under uneven traffic, but it is highly complicated. To overcome the above shortcomings, the paper presents a low coraplex and high efficient schedulingalgoriths, CRR-FRR. The new algorithm doesn＇t need comparison and sorting, is easy to implement by hardware and has good scalability. Simulation results show that CRR-FRR can performan very well at average delay with uneven traffic with Bernoulli and burst arrivals.
出处
《计算机应用与软件》
CSCD
北大核心
2012年第7期119-122,共4页
Computer Applications and Software
基金
福建省教育厅科技项目(JB11321)
关键词
CICQ
交换结构
调度算法
CRR-FRR
时延
CICQ Switch fabric Scheduling algorithm CRR-FRR（current priority round robin and full priority round robin） Delay
