一种新的输入排队crossbar的公平调度算法

A Novel Fair Scheduling Algorithm for Input-Queued Crossbars

本文提出一种新的输入排队crossbar调度算法——WMFS(weightedmax -minfairscheduling)算法 ,可以为各个竞争的流提供近似的归一化公平服务 ,保证了带宽分配的加权max- min公平性 .另外 ,仿真结果表明在均匀业务流到达情况下 ,WMFS具有 1 0 0 %的吞吐量和良好的时延性能 .

We proposed a weighted max-min fair scheduling(WMFS) algorithm,that provides approximately normalized fair service guarantees and weighted max-min fair bandwidth allocation distribution among the contending flows,for input-queued crossbars.Furthermore,results from simulation show that the algorithm is able to achieve asymptotically 100% throughput and low cell latency under uniform traffic.