A Parallel Priority Queue with Constant Time Operations
نویسندگان
چکیده
منابع مشابه
A Parallel Priority Queue with Constant Time Operations
We present a parallel priority queue that supports the following operations in constant time: parallel insertion of a sequence of elements ordered according to key, parallel decrease key for a sequence of elements ordered according to key, deletion of the minimum key element, and deletion of an arbitrary element. Our data structure is the first to support multi-insertion and multi-decrease key ...
متن کاملParallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREW-PRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is obtained as an extension of the traditional binary-heap organization. Using an MH, it is shown that insertion of a new item or deletion of the smallest item from a priority queue of n elements can be performed in O(l...
متن کاملA Survey on Parallel Algorithms for Priority Queue Operations
Parallel Priority Queue (PPQ) data structure supports parallel operations for manipulating data items with keys, such as inserting n new items, deleting n items with the smallest keys, creating a new PPQ that contains a set of items, and melding tow PPQ into one. In this article, we present some recent research works on PPQ which support the simultaneous operations of the k smallest elements, k...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملPriority Queue Operations on EREW-PRAM
Using EREW-PRAM algorithms on a tournament based complete binary tree we implement the insert and extract-min operations with p = log N processors at costs O(1) and O(log log N) respectively. Previous solutions 4, 7] under the PRAM model and identical assumptions attain O(log log N) cost for both operations. We also improve on constant factors the asymptotic bound for extract-min since in it we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1998
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1425