enqueue


Also found in: Dictionary, Thesaurus, Medical, Financial.

enqueue

[en′kyü]
(engineering)
To place a data item in a queue.

enqueue

enqueue

Pronounced "en-q." To place an item in a queue. Contrast with dequeue. See queue and queuing.
Mentioned in ?
References in periodicals archive ?
Enqueue ([c.sub.j],T, [Jlu.sub.d],[vt.sub.ij], VM [cost.sub.ij] ,f(sl)) 19: while Q [not equal to] [empty set] do 20: flag = 0 21: while Q [not equal to] [empty set] && flag==0 do 22: {[c'.sub.j],T',[Jlu'.sub.d],[vt'.sub.ij],VM [cost'.sub.ij]) 23: [left arrow] Q.Dequeue() //the next offer 24: if VM [cost.sub.ij]+ [Cost.sub.t]==VM [cost'.sub.ij]+ [Cost'.sub.t] 25: [T.sub.1].Enqueue ([c'.sub.j], T', [Jlu'.sub.d], [vt'.sub.j] 26: VM [cost'.sub.ij],f(sl)) 27: else 28: flag=1 29: end if 30: end while 31: [T.sub.1].sorting descending order(f(sl)) 32: [Q.sub.1].
A Resource in the Resources pool receives the job by the Job Manager, enqueues the job in the local queue and processes it, according to the position in the queue.
Records are preallocated in a global pool to avoid dynamic memory allocation overhead, and they are pushed and popped using atomic enqueue and dequeue operations to avoid the overhead of locking the global pool.
If there is a write lock on X or all read locks on X are from transactions that have already processed their lock phase, then enqueue the lock request.
Both send and receive operations have the same execution flow depicted in Figure 7, and their enqueue and probe procedures are described as follows.
Somersault is said to eliminate R/3's Enqueue Services as a single point of failure, by providing process mirroring.
An intelligent information-retrieval system could monitor the literature, retrieve papers that mention HIV drug- resistant mutations, extract candidate rules, and automatically enqueue review by domain experts.
[C.sub.B][v] [left arrow] 0, v [epsilon] V; For s [epsilon] V do S [left arrow] emptystack; P[w] [left arrow]emptylist, w[epsilon]V; [sigma][t] [left arrow] 0, t [member of] V; [sigma][s] [left arrow] 1; d[t] [left arrow]1, t [member of] V; d[s] [left arrow] 0; Q[left arrow]emptyqueue; enqueue s s[left arrow]Q; While Q not empty do dequeue v[left arrow]Q; push v[left arrow]S; for each neighbor w of v do //w found for the first time?
The new GPUs include new feature set enhancements with a focus on next-generation compute:Up to 4x higher performance for OpenVX/vision algorithms compared to the previous generation through improved integer (INT) performance (2x INT16; 4x INT8),Bandwidth and latency improvements through shared virtual memory (SVM) in OpenCL 2.0,Dynamic parallelism for more efficient execution and control through support for device enqueue in OpenCL 2.0.
(2) Classify incoming packets and enqueue them in appropriate class buffer using DSCP and 5-tuple information.
enqueue i in q while q is not empty do get friends_uids according to i for each j in friends_uids do if j does not exist in q then insert j into q end end dequeue k from q get profile according to k set i = k end Table 2.
If an enqueue only operation occurred, the total number of entries increases by 1.

Full browser ?