Queue single-cycle scheduling method and device

Abstract

The invention provides a single queue cycle dispatching method and device. The method includes the steps: dispatching a pre-dequeued queue number according to a dispatching rule, reading first package descriptor information of a corresponding queue by taking the queue number as an address, and temporarily storing the read first package descriptor information of the corresponding queue; selecting a dequeued temporarily stored queue according to a dequeuing rule, and continuously dequeuing all sections of a temporarily stored queue package until the queue is switched by taking a clock cycle as a unit according to the first package descriptor information of the temporarily stored queue and acquired package section node information of the temporarily stored queue. By the aid of queue number dispatching of the comprehensive queue and second-level package descriptor dispatching of the queue, single-cycle dequeuing dispatching is achieved, dequeuing capacity and dequeuing bandwidth are furthest improved, high dequeuing bandwidth is achieved under small system clock frequency, power consumption of a chip is greatly reduced, and dequeuing performance is improved.

Description

technical field [0001] The invention relates to queue scheduling technology, in particular to a queue single-cycle scheduling method and device. Background technique [0002] Queue scheduling, that is, the queue passes certain trigger checks (such as receiving authorization triggers, etc.), arbitrates the queue exit conditions, and schedules the queue to exit the queue in an orderly manner according to certain rules. Commonly used scheduling algorithms mainly include round robin (RR, RoundRobin) scheduling algorithm and strict priority (SP, Strict Priority) scheduling algorithm. [0003] The implementation principle of the round-robin scheduling algorithm is to poll the queue one by one and circularly to dequeue in a certain order. Schedule a queue to be dequeued every clock cycle, and then poll the next queue for dequeuing on the next clock cycle. The strict priority scheduling algorithm is to set different priorities for the queues, and each time the queue with the highe...

AI Technical Summary

Problems solved by technology

[0007] The embodiment of the present invention provides a queue single-cycle scheduling method and device to overcome the problem that the prior art cannot meet the expected requirements of the packet forwarding rate

Images