dequeue

Also found in: Dictionary, Acronyms, Wikipedia.

dequeue

[dē′kyü]

(engineering)

To select an item from a queue.

dequeue

queue

dequeue

Pronounced "dee-q." To remove an item from a queue. Contrast with enqueue.

Mentioned in ?

References in periodicals archive ?

But to guard against losing the output in the event of failure, the MM transaction that dequeues the output must not commit until it is sure that the user actually saw it.

Transaction processing monitors

template <class T> signature DEQueue { void enqueueHead (T); T dequeueHead (); void enqueueTail (T); T dequeuetail (); }; template <class T> signature Queue void enqueueTail (T); T dequeueHead () }; Queue<int> * q1 = new DoublyLinkedList<int>; DeQueue<char *> * q2 = new DoublyLinkedList<char *>;

Implementing signatures for C++

All of these have an O(long n) average time for an enqueue followed by a dequeue.

The hold model allows the average combined time for enqueue and dequeue to be measured as a function of the queue size and random number distribution.

When these implementations were examined for opportunities to introduce fine grained concurrency control, most were eliminated because they compute the new root of the tree representing the queue only at the very end of the enqueue or dequeue procedures; as a result, these implementations require users to take exclusive use of the root of the tree for the entire duration of each operation.

The implicit heap is disqualified for a different reason: With this implementation, enqueue involves a bottom-up search from a leaf of the (implicit) tree, while dequeue involves a top-down search from the root.

Dequeue returns the root of the heap and melds its two subheaps, while enqueue treats the item to be enqueued as a one item heap and melds it with the original one.

Concurrent operations on priority queues

et a hold operation refer to a dequeue followed immediately by an enqueue.

If only one bucket out of a hundred contains an entry, the dequeue time will be long since an average of a hundred empty buckets will have to be examined during each dequeue to find the next entry.

Enqueue and dequeue times are smallest when the bucket width is somewhere in the vicinity of the average separation of adjacent queue elements.

Whenever the dequeue operation cycles through all of the buckets in the calendar without finding an event in the current year, it cycles through again looking for the lowest priority item in the queue.

Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem

For job allocation, the mobile job coordinator sorts the resource list by mobile resource reliability in a descending order and dequeues a job from the mobile job queue.