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… (More)
Wikipedia

Related topics

Related topics

50 relations
Abstract data typeArray data structureBest-first searchBit array
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The SprayList: a scalable relaxed priority queue
High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Cache-oblivious priority queue and graph algorithm applications
(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
Scalable Concurrent Priority Queue Algorithms
This paper addresses the problem of designing bounded range priority queues, that is, queues that support a fixed range of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Worst-Case Efficient Priority Queues
Au implementation of priority queues is presented that supports the operations MAKEQUEUE, FINDMIN, INSERT, MELD and DECREASEKEY… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Rate-Controlled Static-Priority Queueing
We propose a new service discipline, called the Rate-Controlled Static-Priority (RCSP) queueing discipline, that can provide… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1992
1992
Parallel heap: An optimal parallel priority queue
We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Concurrent Access of Priority Queues
The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
An Empirical Comparison of Priority-Queue and Event-Set Implementations
Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
A Data Structure for Manipulating Priority Queues
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Design and implementation of an efficient priority queue
We present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a priority queue… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?