The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2002 vol.22)
pp: 19-25
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>
CITATION
Paolo Giaccone, Devavrat Shah, Balaji Prabhakar, "An Implementable Parallel Scheduler for Input-Queued Switches", IEEE Micro, vol.22, no. 1, pp. 19-25, January/February 2002, doi:10.1109/40.988686
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool