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
ASCII Text
x 
 
Devavrat Shah, Paolo Giaccone, Balaji Prabhakar, "Efficient Randomized Algorithms for Input-Queued Switch Scheduling," IEEE Micro, vol. 22, no. 1, pp. 10-18, January/February, 2002.
 
 
BibTex
x
 
@article{ 10.1109/40.988685,
author = {Devavrat Shah and Paolo Giaccone and Balaji Prabhakar},
title = {Efficient Randomized Algorithms for Input-Queued Switch Scheduling},
journal ={IEEE Micro},
volume = {22},
number = {1},
issn = {0272-1732},
year = {2002},
pages = {10-18},
doi = {http://doi.ieeecomputersociety.org/10.1109/40.988685},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - IEEE Micro
TI - Efficient Randomized Algorithms for Input-Queued Switch Scheduling
IS - 1
SN - 0272-1732
SP10
EP18
EPD - 10-18
A1 - Devavrat Shah,
A1 - Paolo Giaccone,
A1 - Balaji Prabhakar,
PY - 2002
VL - 22
JA - IEEE Micro
ER -
 

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.