Subscribe

Issue No.10 - Oct. (2013 vol.62)

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

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2012.198

ABSTRACT

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.198REFERENCES

- [1] N. McKeown, "The iSLIP Scheduling Algorithm for Input-Queued Switches,"
IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, Apr. 1999.- [2] S. Vangal et al., "An 80-tile Sub-100-W Teraflops Processor in 65-nm CMOS,"
IEEE J. Solid-State Circuits, vol. 43, no. 1, pp. 29-41, Jan. 2008.- [3] F.R. Kschischang, B.J. Frey, and H.-A. Loeliger, "Factor Graphs and the Sum-Product Algorithm,"
IEEE Trans. Information Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.- [4] M. Bayati, D. Shah, and M. Sharma, "Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality,"
IEEE Trans. Information Theory, vol. 54, no. 3, pp. 1241-1251, Mar. 2008.- [5] H.A. Bethe, "Statistical Theory of Superlattices,"
Proc. Royal Soc. A, vol. 150, no. 871, pp. 552-575, Jul. 1935.- [6] J. Yedidia, "An Idiosyncratic Journey beyond Mean Field Theory,"
Advanced Mean Field Methods: Theory and Practice, M. Opper and D. Saad, eds. MIT Press, pp. 21-35, 2001.- [7] M. Bayati, B. Prabhakar, D. Shah, and M. Sharma, "Iterative scheduling algorithms,"
Proc. 26th IEEE Int'l Conf. Computer Comm. (INFOCOM '07), pp. 445-453, Dec. 2007.- [8] M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, "On the Exactness of the Cavity Method for Weighted B-Matchings on Arbitrary Graphs and Its Relation to Linear Programs,"
J. Statistical Mechanics: Theory and Experiment, vol. 2008, no. 06, Jun. 2008.- [9] S. Atalla, D. Cuda, P. Giaccone, and M. Pretti, "Belief-Propagation Assisted Scheduling in Input-Queued Switches,"
IEEE 18th Ann. Symp. High Performance Interconnects (HOTI '10), pp. 7-14, Aug. 2010.- [10] S. Atalla, D. Cuda, P. Giaccone, and M. Pretti, "Belief-Propagation Assisted Scheduling in Input-Queued Switches," technical report, http://www. tlc-networks.polito.it/public/ faculty/paolo-giacconepublications, 2013.
- [11] M. Karol, M. Hluchyj, and S. Morgan, "Input versus Output Queueing on a Space-Division Packet Switch,"
IEEE Trans. Comm., vol. 35, no. 12, pp. 1347-1356, Dec. 1987.- [12] N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% Throughput in an Input-Queued Switch,"
IEEE Trans. Comm., vol. 47, no. 8, pp. 1260-1267, Aug. 1999.- [13] J. Dai and B. Prabhakar, "The Throughput of Data Switches with and without Speedup,"
Proc. IEEE 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM '00), vol. 2, pp. 556-564, 2000.- [14] P. Gupta and N. McKeown, "Designing and Implementing a Fast Crossbar Scheduler,"
IEEE Micro, vol. 19, no. 1, pp. 20-28, Jan./Feb. 1999.- [15] N.W. McKeown, "Scheduling Algorithms for Input-Queued Cell Switches," PhD dissertation, Univ. of California at Berkeley, 1995.
- [16] M.F. Tappen and W.T. Freeman, "Comparison of Graph Cuts with Belief Propagation for Stereo, Using Identical MRF Parameters,"
Proc. Ninth IEEE Int'l Conf. Computer Vision (ICCV '03), pp. 900-907, 2003.- [17] N. Farrington et al., "Helios: A Hybrid Electrical/Optical Switch Architecture for Modular Data Centers,"
Proc. ACM SIGCOMM, pp. 339-350, 2010. |