ONE FAIR SCHEDULING ALGORITHM OF INPUT BUFFER SWITCH
Daiyun Weng, Li Yang · 2012
As functional components like switch structure and cache do not need acceleration, the input buffer program becomes the mainstream structure of high-performance devices. Fair resource allocation is a necessary condition for achieving service quality control. The switch scheduling should take both scheduling efficiency and fair resource allocation into account. An iterative matching scheduling algorithm iPFQ for input buffer switch was brought out based on iSLIP. Simulation experiments were used to verify average delay, throughput as well as link bandwidth allocation fairness under different loads when it is uniform distribution and non-uniform Bernoulli arriving probability. The experimental results show that iPFQ can achieve high scheduling efficiency under fair resource allocation.