一种交错编码的多重门限调度算法  

Interleaving Coded Multi-Threshold Scheduling Algorithm

作　　者：伊鹏[1] 汪斌强[1] 陈庶樵[1] 李挥[2] 

机构地区：[1]国家数字交换系统工程技术研究中心,河南郑州450002 [2]北京大学深圳研究生院集成微系统重点实验室,广东深圳518055

出　　处：《软件学报》2009年第8期2289-2297,共9页Journal of Software

基　　金：国家高技术研究发展计划(863)Nos.2007AA01Z218;2008AA01Z214;国家重点基础研究发展计划(973)No.2007CB307102~~

摘　　要：提出一种交错编码的多重门限调度算法(interleaving coded multi-threshold scheduling,简称ICMTS).该算法将前、后级队列门限标记交错编码作为权值表征输入调度过程前、后两级队列的整体调度需求,根据交错编码的权值对前级虚拟输出队列进行优化调度判决,并通过多重门限机制降低算法的硬件资源开销.采用流模型证明当加速因子为2时,ICMTS算法可获得100%的吞吐量,并给出ICMTS算法的工程简化设计方案,复杂度为O(logN).仿真仿真结果表明,采用ICMTS算法的工程简化方案即可获得比现有算法更优的调度性能.An interleaving coded multi-threshold scheduling （ICMTS） algorithm is proposed in this paper. Since the ICMTS algorithm uses the interleaving coded thresholds of two stage queues as the scheduling weights, it can systematically evaluate the scheduling demands of both the input queues and the crosspoint queues. By segmenting the queue length as multiple thresholds, the hardware resource of this algorithm can be largely decreased. It is proved that a CICQ （combined input-crosspoint-queued） switch operating with the ICMTS algorithm can achieve 100% throughput with a speedup of two. To facilitate hardware implementation, a simplified maximal ICMTS scheme is also presented with a time complexity of O（logN）. Simulation results show that even the simplified ICMTS scheme can obtain better performance than the existing algorithms.

关 键 词：交换结构 调度算法 联合输入交叉节点排队 带缓存交叉开关 

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