A Novel High Performance Scheduling Algorithm for Crosspoint Buffered Crossbar Switches

DOI

10.2991/cisia-15.2015.16How to use a DOI?

Keywords

cross point buffered crossbar switches; scheduling; delay; fairness

Abstract

Crosspoint buffered crossbar switches have gained much attention due to simple distributed scheduling algorithms. However, almost all the algorithms proposed for buffered crossbar switches either have unsatisfactory scheduling performance under non-uniform traffic or poor service fairness between input traffic flows. In order to overcome the disadvantages, in this paper we propose a novel efficient scheduling algorithm named MCQF_RR, which takes advantage of the combined information about queue length and service waiting time of queues to perform scheduling, in order to ensure good service fairness. Simulation results show that the proposed MCQF_RR demonstrates good delay performance comparable to existing efficient algorithms under various admissible traffic patterns, while achieve better service fairness under extreme non-uniform traffic.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - X.T Wang
AU  - Y.W Wang
AU  - S.C Li
AU  - P. Li
PY  - 2015/06
DA  - 2015/06
TI  - A Novel High Performance Scheduling Algorithm for Crosspoint Buffered Crossbar Switches
BT  - Proceedings of the International Conference on Computer Information Systems and Industrial Applications
PB  - Atlantis Press
SP  - 59
EP  - 62
SN  - 2352-538X
UR  - https://doi.org/10.2991/cisia-15.2015.16
DO  - 10.2991/cisia-15.2015.16
ID  - Wang2015/06
ER  -