dequeue

(redirected from dequeued)
Also found in: Encyclopedia.

dequeue

(diːˈkjuː)
vb
to remove (an item) from a queue of tasks
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
Translations
jonopoistaa
References in periodicals archive ?
The scheduling algorithm is a key component for QoS enabling networks, that determines the order in which packets are dequeued to the interface for transmission on the physical wire.
The LLQ algorithm allows delay-sensitive data (such as voice) to be given preferential treatment over other traffic by letting the data to be dequeued and sent first.
Since every vertex can be enqueued and dequeued at most once for a given [v.sub.s] [member of] CSV([v.sub.i], [v.sub.j]), the operations in Step 4 can be applied to every vertex at most once; thus, the total time devoted to the operations in Step 4 is O(n).
We use a moving window method to update the model dataset (i.e., [D.sub.q] for all q [member of] Q) based on first-in-first-out (FIFO) policy where the new data point is inserted and the earliest one is dequeued. The dataset ([D.sub.q]) for each discrete state q is updated independently, and then it is used to update its corresponding (G[P.sub.q]) model and to reoptimize its hyperparameters ([[??].sub.q]).
Afterwards, the items are dequeued on a highest-priority-first basis.
When a data entry is dequeued, it is inserted into the result set.
LLQ queues delay sensitive traffic and allow it to be dequeued and if there are no more packets in that queue then WFQ executes the rest of the traffic and the normal scheduler logic applies to other non latency queues giving them their guaranteed bandwidth.
While the current shape is being grown, as soon as the thresholds are met in both directions, the entry is dequeued and enqueued again into the FIFO and the next shape is then grown.
Using the first in--first out (FIFO) mechanism, packets are dequeued from the queues in accordance with their priorities.
In general, the behavior of an FIFO must meet the following requirements: (1) correctness of full and empty flags, and (2) enqueued data must be dequeued in the correct order while maintaining uncorrupted data.
Notice that it is not really necessary to provide the correct distance when enqueueing the root node, since it will always be dequeued first.