Übersetzung für 'priority queue' von Englisch nach Deutsch

priority queue

Prioritätenliste {f}comp.

Vorrangwarteschlange {f}comp.

Prioritätswarteschlange {f}comp.

---

Werbung

queue

Warteschleife {f}

Queue {f}comp.spec.

Pufferinhalt {m}

Reihe {f}

to queue

eine Warteschlange bilden

Schlange stehen

multi-queue

Mehrfachwarteschlange {f}comp.

message queue

Message Queue {f}comp.

Nachrichten-Warteschlange {f}comp.

Nachrichtenwarteschlange {f}comp.

queue name

Warteschlangenname {m}

hidden queue

nicht einsehbares Stauende {n}traffic

queue management

Warteschlangenverwaltung {f}comp.

input queue

Eingabewarteschlange {f}

queue length

Warteschlangenlänge {f}

queue-jumper

Vordrängler {m}

receive queue

Empfangsqueue {f}comp.

to queue (up)

sich^Akk. anstellen

till queue

Kassenschlange {f} [Warteschlange an der Kasse]

transmit queue

Sendequeue {f}comp.

• Since efficient priority queue data structures require O(log "n") time per insertion, and a tree with "n" leaves has 2"n"−1 nodes, this algorithm operates in O("n" log "n") time, where "n" is the number of symbols.
• The first detail to note is that the way the priority queue handles ties can have a significant effect on performance in some situations.
• Like heapsort, smoothsort organizes the input into a priority queue and then repeatedly extracts the maximum.
• ... it may be a priority queue).
• Efficient (logarithmic time) algorithms are known for the two operations needed to implement a priority queue on a binary heap: inserting an element, and removing the smallest or largest element from a min-heap or max-heap, respectively.

• Yet another alternative is to add nodes unconditionally to the priority queue and to instead check after extraction that it isn't revisiting, or that no shorter connection was found yet.
• The fastest non-randomized comparison-based algorithm with known complexity, by Bernard Chazelle, is based on the soft heap, an approximate priority queue.
• In computer science, a priority queue is an abstract data-type similar to a regular queue or stack data structure.