Blogs Hub

by AskGif | Jan 03, 2019 | Category :coding

What is a Priority Queue?

What is a Priority Queue?

<p>In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued, while in other implementations, ordering of elements with the same priority is undefined.</p> <p>&nbsp;</p> <p>While priority queues are often implemented with heaps, they are conceptually distinct from heaps. A priority queue is an abstract concept like "a list" or "a map"; just as a list can be implemented with a linked list or an array, a priority queue can be implemented with a heap or a variety of other methods such as an unordered array.</p> <p>&nbsp;</p> <p>In some situations we may need to find the minimum/maximum element among a collection of elements. WE can do this with the help of Priority Queue ADT. A priority queue ADT is a data structure that supports the operations insert and DeleteMmin (which returns and removes the minimum element) or DeleteMax (which returns and removes the maximum element).</p> <p>These operations are equivalent ot EnQueue and DeQueue operations of a queue. The difference is that, in priority queues, the order in which the elements enter the queue may not be the same in which they were processed. An exaple application of a priority queue is job schedulig, which is prioritized instead of serving in first come first serve.</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>Applications</p> <p>Bandwidth management</p> <p>Priority queuing can be used to manage limited resources such as bandwidth on a transmission line from a network router. In the event of outgoing traffic queuing due to insufficient bandwidth, all other queues can be halted to send the traffic from the highest priority queue upon arrival. This ensures that the prioritized traffic (such as real-time traffic, e.g. an RTP stream of a VoIP connection) is forwarded with the least delay and the least likelihood of being rejected due to a queue reaching its maximum capacity. All other traffic can be handled when the highest priority queue is empty. Another approach used is to send disproportionately more traffic from higher priority queues.</p> <p>&nbsp;</p> <p>Many modern protocols for local area networks also include the concept of priority queues at the media access control (MAC) sub-layer to ensure that high-priority applications (such as VoIP or IPTV) experience lower latency than other applications which can be served with best effort service. Examples include IEEE 802.11e (an amendment to IEEE 802.11 which provides quality of service) and ITU-T G.hn (a standard for high-speed local area network using existing home wiring (power lines, phone lines and coaxial cables).</p> <p>&nbsp;</p> <p>Usually a limitation (policer) is set to limit the bandwidth that traffic from the highest priority queue can take, in order to prevent high priority packets from choking off all other traffic. This limit is usually never reached due to high level control instances such as the Cisco Callmanager, which can be programmed to inhibit calls which would exceed the programmed bandwidth limit.</p> <p>&nbsp;</p> <p>Discrete event simulation</p> <p>Another use of a priority queue is to manage the events in a discrete event simulation. The events are added to the queue with their simulation time used as the priority. The execution of the simulation proceeds by repeatedly pulling the top of the queue and executing the event thereon.</p> <p>&nbsp;</p> <p>See also: Scheduling (computing), queueing theory</p> <p>&nbsp;</p> <p>Dijkstra's algorithm</p> <p>When the graph is stored in the form of adjacency list or matrix, priority queue can be used to extract minimum efficiently when implementing Dijkstra's algorithm, although one also needs the ability to alter the priority of a particular vertex in the priority queue efficiently.</p> <p>&nbsp;</p> <p>Huffman coding</p> <p>Huffman coding requires one to repeatedly obtain the two lowest-frequency trees. A priority queue is one method of doing this.</p> <p>&nbsp;</p> <p>Best-first search algorithms</p> <p>Best-first search algorithms, like the A* search algorithm, find the shortest path between two vertices or nodes of a weighted graph, trying out the most promising routes first. A priority queue (also known as the fringe) is used to keep track of unexplored routes; the one for which the estimate (a lower bound in the case of A*) of the total path length is smallest is given highest priority. If memory limitations make best-first search impractical, variants like the SMA* algorithm can be used instead, with a double-ended priority queue to allow removal of low-priority items.</p> <p>&nbsp;</p> <p>ROAM triangulation algorithm</p> <p>The Real-time Optimally Adapting Meshes (ROAM) algorithm computes a dynamically changing triangulation of a terrain. It works by splitting triangles where more detail is needed and merging them where less detail is needed. The algorithm assigns each triangle in the terrain a priority, usually related to the error decrease if that triangle would be split. The algorithm uses two priority queues, one for triangles that can be split and another for triangles that can be merged. In each step the triangle from the split queue with the highest priority is split, or the triangle from the merge queue with the lowest priority is merged with its neighbours.</p> <p>&nbsp;</p> <p>Prim's algorithm for minimum spanning tree</p> <p>Using min heap priority queue in Prim's algorithm to find the minimum spanning tree of a connected and undirected graph, one can achieve a good running time. This min heap priority queue uses the min heap data structure which supports operations such as insert, minimum, extract-min, decrease-key.[16] In this implementation, the weight of the edges is used to decide the priority of the vertices. Lower the weight, higher the priority and higher the weight, lower the priority.</p> <p>source: https://en.wikipedia.org/wiki/Priority_queue</p>

read more...