Dynamic queueing method
US4807111A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jun 19, 1987 |
| Grant date | Feb 21, 1989 |
| Priority date | — |
| Expiry date | Jun 19, 2007 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4881
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
This disclosure shortens a dispatching queue by deleting those queue elements having all task blocks in a wait state. The queue has no serializing lock, so that it may be used in parallel by simultaneous requestors in a multiprocessing environment. Whenever any new or deleted element acquires a dispatchable block, a dispatchability indicator is entered for the element; and if the element is off the queue, it is then inserted into the queue in a priority order of elements in the queue. Coordinated communication is provided for all other requestors that may simultaneous access any element (whether on or off the queue) by providing special flag fields for each element that indicate: the changeable/nonchangeable state of the pointer to the next element in the queue, whether the element is on or off the queue, and an identifier of the current requestor accessing the element to possibly insert or delete the element. It is important to understand that although one of these flags is called a "pointer lock", it only controls the "changeability" of the contained pointer to the next queue element, and that this pointer lock does not lock anything (i.e. does not serialize access to anything in…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.