Skip to search formSkip to main contentSkip to account menu

Priority queue

Known as: PQ, Priority traffic, Minimum priority queue 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract data typeArray data structureBest-first searchBit array

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Locating emergency services with different priorities: the priority queuing covering location problem
Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting… 
Highly Cited
2008
Highly Cited
2008
Dependency Parsing by Belief Propagation
We formulate dependency parsing as a graphical model with the novel ingredient of global constraints. We show how to apply loopy… 
Highly Cited
2007
Highly Cited
2007
The analytic hierarchy and analytic network measurement processes: Applications to decisions under Risk
Mathematics applications largely depend on scientific practice. In science measurement depends on the use of scales, most… 
Highly Cited
2006
Highly Cited
2006
O(N) implementation of the fast marching algorithm
Highly Cited
2005
Highly Cited
2005
An Efficient and Versatile Query Engine for TopX Search
This paper presents a novel engine, coined TopX, for efficient ranked retrieval of XML documents over semistructured but… 
Review
2000
Review
2000
Task switching and multitask performance.
Research on task switching and dual-task performance has spawned two literatures that have, to a surprising extent, developed… 
Highly Cited
1993
Highly Cited
1993
Rate-controlled static-priority queueing
The authors propose a service discipline, called the rate-controlled static-priority (RCSP) queuing discipline, that provides… 
Highly Cited
1993
Highly Cited
1993
Building FIFO and Priority-Queuing Spin Locks from Atomic Swap
We present practical new algorithms for FIFO or priority-ordered spin locks on shared-memory multiprocessors with an atomic swap… 
Highly Cited
1966
Highly Cited
1966
The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
A priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or… 
Highly Cited
1961
Highly Cited
1961
Preemptive Resume Priority Queue
The queue length probability generating function for a preemptive resume priority queue characterized by Poisson arrivals and… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)