The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms...The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.展开更多
针对iSLIP(iterative round robin matching with slip)算法在处理突发业务时性能严重恶化的问题,在iSLIP算法的基础上提出了一种流量自适应的时隙间迭代算法TA-iSLIP(traffic adaptive iSLIP)．该算法根据队列长度智能判断当前流量情况...针对iSLIP(iterative round robin matching with slip)算法在处理突发业务时性能严重恶化的问题,在iSLIP算法的基础上提出了一种流量自适应的时隙间迭代算法TA-iSLIP(traffic adaptive iSLIP)．该算法根据队列长度智能判断当前流量情况,采取不同的调度策略,充分利用已经匹配的资源,使系统的匹配开销尽可能减小．并给出了TA-iSLIP的算法描述和性能评价,与iSLIP算法、FIRM(fcfs in round-robin matching)算法进行了比较．仿真结果表明,TA-iSLIP在均匀和非均匀流量下都达到了较好的性能,在非均匀流量下的吞吐率达到97％以上．展开更多
文摘The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient.
文摘针对iSLIP(iterative round robin matching with slip)算法在处理突发业务时性能严重恶化的问题,在iSLIP算法的基础上提出了一种流量自适应的时隙间迭代算法TA-iSLIP(traffic adaptive iSLIP)．该算法根据队列长度智能判断当前流量情况,采取不同的调度策略,充分利用已经匹配的资源,使系统的匹配开销尽可能减小．并给出了TA-iSLIP的算法描述和性能评价,与iSLIP算法、FIRM(fcfs in round-robin matching)算法进行了比较．仿真结果表明,TA-iSLIP在均匀和非均匀流量下都达到了较好的性能,在非均匀流量下的吞吐率达到97％以上．
