Belief-Propagation Assisted Scheduling in Input-Queued Switches

Shadi Atalla, Davide Cuda, Paolo Giaccone, Marco Pretti
2010 2010 18th IEEE Symposium on High Performance Interconnects  
We consider the problem of scheduling the transmission of packets in an input-queued switch. In order to achieve maximum throughput, scheduling algorithms usually employ the queue length as a parameter for determining the priority to serve a given queue. In this work we propose a novel scheme to optimize the performance of a preexisting scheduler. Our main idea is to assist the scheduling decision, considering "messages" rather than queue lengths. Such messages are obtained by running an
more » ... ve parallel algorithm, inspired by a rigorous Belief-Propagation approach. We demonstrate that Belief-Propagation-assisted scheduling is able to boost the performance of a given scheduler, reaching almost optimal throughput, even under critical traffic scenarios. Index Terms-Scheduling, input queued switches, belief propagation, maximum weight matching problem, router architectures. S. Atalla and P. Giaccone are with the
doi:10.1109/hoti.2010.11 dblp:conf/hoti/AtallaCGP10 fatcat:b4ku5ubxongvppmba5q5u4lo3m