This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Randomized Algorithms for Input-Queued Switch Scheduling
January/February 2002 (vol. 22 no. 1)
pp. 10-18

High-performance schedulers for input-queued (IQ) switches must find, for each time slot, a good matching between inputs and outputs to transfer packets. At high line rates or for large switches, finding good matchings is complicated. A suite of randomized algorithms for switch scheduling provides performance comparable to that of well-known, effective matching algorithms, yet is simple to implement.

Citation:
Devavrat Shah, Paolo Giaccone, Balaji Prabhakar, "Efficient Randomized Algorithms for Input-Queued Switch Scheduling," IEEE Micro, vol. 22, no. 1, pp. 10-18, Jan.-Feb. 2002, doi:10.1109/40.988685
Usage of this product signifies your acceptance of the Terms of Use.