An implementable parallel scheduler for input-queued switches
2002; Institute of Electrical and Electronics Engineers; Volume: 22; Issue: 1 Linguagem: Inglês
10.1109/40.988686
ISSN1937-4143
AutoresPaolo Giaccone, Devavrat Shah, Balaji Prabhakar,
Tópico(s)Parallel Computing and Optimization Techniques
ResumoThe 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 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.
Referência(s)