Abstract
This paper analyzed the reasons for which the high-speed crossbar scheduling algorithm iSLIP has a serious deterioration of performance under burst traffics.With reference to the ideas of LQF/iLQF,this paper proposed a novel input-queued crossbar scheduling algorithm called iPGQM(iterative Parallel Graded-Length Queue Matching).Simulation results show that iPGQM has the same performance as iSLIP under uniform traffics.Furthermore it has better performance than iSLIP under burst traffics.Especially in heavy load conditions,iPGQM not only achieves higher throughput,but also reduces the average delay about 10% compared with iSLIP algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
