Hardware-based Priority Queues for High-Speed Network Scheduling
Advanced scheduling algorithms have become fervent topics of discussion in fourth generation (4G) router architectural forums. These 4G designs will require sophisticated scheduling algorithms, such as multiple-priority weighted round robin, distributed across a substantial number of queues. Therefore to support wire-speed scheduling systems and to guarantee QoS, implementation of these priority queues in hardware, instead of software, is essential. Hardwarebased priority queues arrange and facilitate scheduling by execution eligibility and communicate relative importance parameters to the scheduling algorithm. These priority queues sort the queued elements in a decreasing order of priority; and, thus reduce the task of highest-priorityfirst scheduling policies to a simple removal of the queue?s topmost element.
Please disable any pop-up blockers for proper viewing of this Whitepaper.