Issue No. 01 - January/February (2002 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/40.988686
<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>
P. Giaccone, D. Shah and B. Prabhakar, "An Implementable Parallel Scheduler for Input-Queued Switches," in IEEE Micro, vol. 22, no. , pp. 19-25, 2002.