An implementable parallel scheduler for input-queued switches

摘要

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(N{sup}3) iterations of more common maximum-weight matching algorithm. Apsara also achieves a throughput of up to 100 percent and has very good delay properties.