Abstract:
A scheduler includes a sorting unit that has n comparators to identify a smallest virtual finish time (VFT) value from 2n VFT entries. Each of the VFT entries may include a valid bit to indicate its validity.
Abstract:
A packet scheduler has input connections, and data packets received on the input connections can be placed in queues. The packet scheduler includes a first scheduler, for identifying a first of said queues according to a first queue scheduling algorithm, and a second scheduler, for identifying a second of said queues according to a second queue scheduling algorithm. The packet scheduler determines whether the first of said queues contains a packet of data to be sent and, if so, it selects the first of said queues as a selected queue. If the first of said queues does not contain a packet of data to be sent, it selects the second of said queues as a selected queue. The packet scheduler then determines whether the respective packet of data can be sent from the selected queue, by maintaining a deficit counter indicating a current data quota for the respective queue, and also by maintaining a global deficit counter.