METHOD AND DEVICE FOR SCHEDULING QUEUES BASED ON CHAINED LIST

摘要

A method for scheduling a queue based on a chained list is provided. The method includes the following steps: setting the number of addresses in a queuing chained list to be not less than the number of queues, and partitioning said queuing chained list into different queuing sub-chained lists according to the various queue priorities; the number of addresses in the queuing sub-chained list is not less than the total number of queues whose priorities correspond to the queuing sub-chained list. A queuing chained list identifier identifying whether the queue is queued in the queuing chained list is then set for each queue; before a queue satisfying queuing criteria is added to the queuing chained list, it is first determined whether said queue is queued in the queuing chained list according to a queuing chained list identifier; if it is, said adding is not processed, if it is not, the queue is added to the end of the queuing sub-chained list corresponding to the priority of the queue, and the queuing chained list identifier of the queue is modified to become an identifier identifying the queue as already queued in the queuing chained list. A device for scheduling a queue based on a chained list is also provided. Utilization of the provided method and device ensures impartiality when queues having the same priority are scheduled.