In this paper we focus on how to achieve optimal speedup for the individual priority queue operations known from the sequential setting.
plement priority queues on parallel machines [3, 4, 5, 11, 15, 16, 17, 18]. In this paper we focus on how to achieve optimal speedup for the individual priority.
Priority queue operations. MakeQueue. FindMin(Q). Insert(Q e). Meld(Q1 Q2). ExtractMin(Q). Delete(Q e)*. DecreaseKey(Q e e0)*, e0 e. Build(e1 ::: en).
Abstract. We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one proces-sor and MakeQueue, ...
People also ask
What is the best structure for priority queue?
When would you use a priority queue?
What is the most efficient way to implement priority queue?
How many queues are required for a priority queue?
Jun 7, 2005 · A priority queue can be build in time O(log n) with O(n/log n) processors and k elements can be inserted into a priority queue in time O(log k) ...
Optimal parallel initialization algorithms for a class of priority ...
ieeexplore.ieee.org › document
An adaptive parallel algorithm for inducing a priority queue structure on an n-element array is presented. The algorithm is extended to provide optimal ...
In this paper we present a parallel priority queue which supports simultaneous insertion and simultaneous decrease key of an arbitrary sequence of elements ...
Jul 22, 2021 · Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event ...
Dec 10, 2024 · This paper presents parallel algorithms for priority queue operations on a p-processor EREW-PRAM. The algorithms are based on a new data ...
We present simple and portable randomized algorithms for parallel priority queues on distributed memory machines with fully distributed storage. ... Priority ...