This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Belief-Propagation-Assisted Scheduling in Input-Queued Switches
Oct. 2013 (vol. 62 no. 10)
pp. 2101-2107
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.
Index Terms:
Switches,Hardware,Scheduling,Convergence,Computer architecture,Fabrics,Throughput,router architectures,Scheduling,input-queued switches,belief propagation,maximum weight matching problem
Citation:
Shadi Atalla, Davide Cuda, Paolo Giaccone, Marco Pretti, "Belief-Propagation-Assisted Scheduling in Input-Queued Switches," IEEE Transactions on Computers, vol. 62, no. 10, pp. 2101-2107, Oct. 2013, doi:10.1109/TC.2012.198
Usage of this product signifies your acceptance of the Terms of Use.