基于匹配预测的交换调度算法  

Crossbar Scheduling Algorithm Based on Pre-Matched iSlip

作　　者：李胜磊[1] 张德运[1] 刘刚[1] 

机构地区：[1]西安交通大学电子与信息工程学院,西安710049

出　　处：《西安交通大学学报》2003年第10期1016-1019,1024,共5页Journal of Xi'an Jiaotong University

基　　金：西安市重大科技攻关基金资助项目

摘　　要：提出一种新的虚拟输出队列调度算法MiSlip.该算法在iSlip算法的3步匹配基础上,增加了预匹配过程,考虑到连续两次调度过程的相关性,通过利用前次调度过程中的有效信息,在输入和输出端口之间满足特定条件的情况下,可以准确预测本次调度的匹配结果,从而减少了本次匹配过程的迭代次数,提高了匹配准确度和iSlip算法的性能.仿真结果表明,与iSlip算法相比,在保持吞吐量和丢包率不变的情况下,MiS lip可以明显地提高迭代效率,降低调度时延.Based on the research of various virtual output queuing (VOQ) schedule algorithm, a VOQ scheduling algorithm-MiSlip is introduced, which extends the famous iSlip algorithm's three steps solution to four steps by adding a pre-match step. Considering the relation between two consecutive schedule periods, the last period schedule information matching some condition can be used by MiSlip to predict this period's matching result. Simulations are carried out to study the effectiveness of MiSlip and the results show that MiSlip is simpler and works very well. Comparing with iSlip, the algorithm can increase the iteration efficiency and decrease the scheduling delay while maintaining the throughout and packet loss rate unchanged.

关 键 词：调度算法 匹配 虚拟输出队列 

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