| 摘要 |
PURPOSE:To shorten the processing time for operation of a queue by giving an access to a storage means corresponding to the priority of the element when this element is enqueued to the queue and omitting the read accesses of many times to a main storage. CONSTITUTION:The element of a queue of a main storage 3 is enqueued in the prescribed four steps and a queue having an element is formed in the storage 3. The information necessary for enqueuing to the queue is also formed in a main storage 21. While the element of the queue in the storage 3 is dequeued in the prescribed four steps and an element is excluded out of the queue of the storage 3. Then the information is formed in the storage 21 for enqueuing to the queue. The storage 21 stores the address of the final element, data of the chain pointer and the number of elements for each priority of the queue. An access is given to the storage 21 corresponding to the priority of the relevant element when the element is enqueued to the queue. Thus the read access is omitted to the storage 3. This can reduce the processing time needed for the queuing operation. |
