| 摘要 |
The present invention discloses a method for scheduling queues based on a chained list. The method includes the following steps: setting the number of addresses in a queuing chained list not less than the number of queues, and partitioning the queuing chained list into different queuing sub-chained lists according to the priorities of the queues, wherein the number of the addresses in the queuing sub-chained list is not less than the total number of the queues whose priorities correspond to the queuing sub-chained list; setting for each queue a queuing chained list identifier identifying whether the each queue has queued in the queuing chained list; determining whether a queue satisfying queuing criteria has queued in the queuing chained list according to the queuing chained list identifier of the queue before the queue is added to the queuing chained list; if it has queued, adding is not processed, otherwise, the queue is added to the end of the queuing sub-chained list which corresponds to the priority of the queue, and the queuing chained list identifier of the queue is modified to an identifier identifying the queue has already queued in the queuing chained list. The present invention also discloses a device for scheduling queues based on a chained list. The present invention ensures impartiality when queues having the same priority are scheduled.
|
