This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Implementable Parallel Scheduler for Input-Queued Switches
January/February 2002 (vol. 22 no. 1)
pp. 19-25

The Apsara algorithm is an input-queued switch scheduler that uses limited parallelism to find a matching in a single iteration, as compared to the O(N3) iterations of the more common maximum-weight matching algorithm. Apsara also achieves a throughput of up to 100 percent and has very good delay properties.

Citation:
Paolo Giaccone, Devavrat Shah, Balaji Prabhakar, "An Implementable Parallel Scheduler for Input-Queued Switches," IEEE Micro, vol. 22, no. 1, pp. 19-25, Jan.-Feb. 2002, doi:10.1109/40.988686
Usage of this product signifies your acceptance of the Terms of Use.