Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents

ID: 517960.0, MPI für Informatik / Algorithms and Complexity Group
A Parallel Priority Queue with Constant Time Operations
Authors:
Language:English
Date of Publication (YYYY-MM-DD):1998
Title of Journal:Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures
Volume:49
Issue / Number:1
Start Page:4
End Page:21
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:We present a parallel priority queue that supports the following
operations in constant time: {\em parallel insertion\/} of a
sequence of elements ordered according to key,
{\em parallel decrease key\/} for a sequence of elements ordered
according to key, {\em deletion of the minimum key element}, as well as
{\em deletion of an arbitrary element}. Our data structure is the first
to support multi insertion and multi decrease key in constant time.
The priority queue can be implemented on the EREW PRAM, and can
perform any sequence of $n$ operations in $O(n)$ time and $O(m\log n)$ work, $m$ being the total number of keys inserted and/or
updated. A main application is a parallel implementation of
Dijkstra's algorithm for the single-source shortest path problem,
which runs in $O(n)$ time and $O(m\log n)$ work on a CREW PRAM on
graphs with $n$ vertices and $m$ edges. This is a logarithmic factor
improvement in the running time compared with previous approaches.
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Article
Communicated by:Kurt Mehlhorn
Affiliations:
Identifiers:LOCALID:C1256428004B93B8-B361FCC97C8B40D1C125670200693C69-...
ISSN:0743-7315
 The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.