Results 1 - 10 of 97,646

On RAM priority queues

by Mikkel Thorup , 1996
"... Priority queues are some of the most fundamental data structures. They are used directly for, say, task scheduling in operating systems. Moreover, they are essential to greedy algorithms. We study the complexity of priority queue operations on a RAM with arbitrary word size. We present exponential i ..."
Abstract - Cited by 72 (10 self) - Add to MetaCart
Priority queues are some of the most fundamental data structures. They are used directly for, say, task scheduling in operating systems. Moreover, they are essential to greedy algorithms. We study the complexity of priority queue operations on a RAM with arbitrary word size. We present exponential

A Survey on Priority Queues

by Gerth Stølting Brodal
"... Abstract. Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on prio ..."
Abstract - Add to MetaCart
Abstract. Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research

Priority Queues on Parallel Machines

by Gerth St, Gerth St��lting Brodal - In Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT , 1996
"... . We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one processor and MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O(n= l ..."
Abstract - Add to MetaCart
. We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one processor and MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O

Abstract Checking Priority Queues

by Ulrich Finkler
"... We describe a checker for priority queues. It supports the full repertoire of priority queue operations (insert, del~~in, find-m&, decrease-p, and del-item). It requires U ( 1) amortised time per operation and uses linear additional space (i.e. the same amouut as t.he priority queue). The checke ..."
Abstract - Add to MetaCart
We describe a checker for priority queues. It supports the full repertoire of priority queue operations (insert, del~~in, find-m&, decrease-p, and del-item). It requires U ( 1) amortised time per operation and uses linear additional space (i.e. the same amouut as t.he priority queue

Priority Queues on Parallel Machines

by Gerth Stølting Brodal , 1996
"... We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one processor and MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O(n= lo ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one processor and MakeQueue, Insert, Meld, FindMin, ExtractMin, Delete and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O

Permuting machines and priority queues

by unknown authors , 2005
"... Machines whose sole function is to re-order their input data are considered. Every such machine defines a set of allowable input-output pairs of permutations. These sets are studied in terms of the minimal disallowed pairs (the basis). Some allowable sets with small bases are considered including th ..."
Abstract - Add to MetaCart
the one defined by a priority queue machine. For more complex machines defined by two or more priority queues in series or parallel the basis is proved to be infinite.

Randomized Meldable Priority Queues

by Anna Gambin, Adam Malinowski
"... We present a practical meldable priority queue implementation. All priority queue operations are very simple and their logarithmic time bound holds with high probability, which makes this data structure more suitable for real-time applications than those with only amortized performance guarantees. O ..."
Abstract - Add to MetaCart
We present a practical meldable priority queue implementation. All priority queue operations are very simple and their logarithmic time bound holds with high probability, which makes this data structure more suitable for real-time applications than those with only amortized performance guarantees

On priority queues with priority jumps

by Tom Maertens, Joris Walraevens, Herwig Bruneel
"... In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions ..."
Abstract - Add to MetaCart
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive

Melding Priority Queues

by Ran Mendelson, Robert E. Tarjan, Mikkel Thorup, Uri Zwick - In Proc. of 9th SWAT , 2004
"... We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the priority queue, can be converted into a priority queue data structure that also supports fast meld operations with essentially ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the priority queue, can be converted into a priority queue data structure that also supports fast meld operations

Rank-Sensitive Priority Queues

by Brian C. Dean, Zachary H. Jones
"... Abstract. We introduce the rank-sensitive priority queue — a data structure that always knows the minimum element it contains, for which insertion and deletion take O(log(n/r)) time, with n being the number of elements in the structure, and r being the rank of the element being inserted or deleted ( ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. We introduce the rank-sensitive priority queue — a data structure that always knows the minimum element it contains, for which insertion and deletion take O(log(n/r)) time, with n being the number of elements in the structure, and r being the rank of the element being inserted or deleted
Results 1 - 10 of 97,646