The Community for Technology Leaders
Green Image
ABSTRACT
<p>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.</p>
INDEX TERMS
CITATION
Paolo Giaccone, Devavrat Shah, Balaji Prabhakar, "An Implementable Parallel Scheduler for Input-Queued Switches", IEEE Micro, vol. 22, no. , pp. 19-25, January/February 2002, doi:10.1109/40.988686
98 ms
(Ver )