期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
High Throughput Scheduling Algorithms for Input Queued Packet Switches 被引量:2
1
作者 R.Chithra Devi D.Jemi Florinabel Narayanan Prasanth 《Computers, Materials & Continua》 SCIE EI 2022年第1期1527-1540,共14页
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. 展开更多
关键词 Crossbar switch input queued switch virtual output queue scheduling algorithm high performance computing
下载PDF
AN EFFICIENT SCHEDULING ALGORITHM FOR INPUT-QUEUED SWITCHES
2
作者 Hu Qingsheng Sun Yuan Han Jiangtao 《Journal of Electronics(China)》 2007年第2期251-256,共6页
This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adap... This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic. 展开更多
关键词 input Queuing (IQ) switches Scheduling algorithm THRESHOLD
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部