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.展开更多
This paper studies the multiuser diversity with constellation selection based on a virtual representation of realistic Multiple Input Multiple Output （MIMO） correlated channels. To realize multiuser diversity in slo...This paper studies the multiuser diversity with constellation selection based on a virtual representation of realistic Multiple Input Multiple Output （MIMO） correlated channels. To realize multiuser diversity in slow fading channels, random beamforming is adopted. Random beamforming matrix exploiting virtual channel representation is constructed, which can match the channel matrix of the desired user better. Sirnultaneously, adaptive coded modulation is applied to each sub-channel of the selected user to improve the system performance further.展开更多
文摘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.
基金Supported by the National Natural Science Foundation of China(No.60496311).
文摘This paper studies the multiuser diversity with constellation selection based on a virtual representation of realistic Multiple Input Multiple Output （MIMO） correlated channels. To realize multiuser diversity in slow fading channels, random beamforming is adopted. Random beamforming matrix exploiting virtual channel representation is constructed, which can match the channel matrix of the desired user better. Sirnultaneously, adaptive coded modulation is applied to each sub-channel of the selected user to improve the system performance further.
