Dynamic queueing method

摘要: This disclosure shortens a dispatching queue by deleting those elements having all task blocks in wait state. The has no serializing lock, so that it may be used parallel simultaneous requestors multiprocessing environment. Whenever any new or deleted element acquires dispatchable block, dispatchability indicator is entered for the element; and if off queue, then inserted into priority order of queue. Coordinated communication provided other access (whether on queue) providing special flag fields each indicate: changeable/nonchangeable state pointer to next whether an identifier current requestor accessing possibly insert delete element. It important understand although one these flags called "pointer lock", only controls "changeability" contained element, this lock does not anything (i.e. serialize queue); example, another read use "locked" as long such change pointer, since while "locked".