|
|||||
|
|
An implementable parallel scheduler for input-queued switches |
|
| Authors: | Giaccone P. Shah D. Prabhakar B. |
| Affiliation: | Electron. Dept., Politecnico di Torino; |
| Abstract: | 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. The Apsara algorithm also achieves a throughput of up to 100 percent and has very good delay properties |
| Keywords: | |