Issue No. 10 - Oct. (2013 vol. 62)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2012.198
Shadi Atalla , Politecnico di Torino, Torino
Davide Cuda , Consiglio Nazionale delle Ricerche, Italy
Paolo Giaccone , Politecnico di Torino, Torino
Marco Pretti , Consiglio Nazionale Ricerche, Italy
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 iterative 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.
Switches, Hardware, Scheduling, Convergence, Computer architecture, Fabrics, Throughput, router architectures, Scheduling, input-queued switches, belief propagation, maximum weight matching problem
P. Giaccone, M. Pretti, D. Cuda and S. Atalla, "Belief-Propagation-Assisted Scheduling in Input-Queued Switches," in IEEE Transactions on Computers, vol. 62, no. , pp. 2101-2107, 2013.