Journal Article10.1007/BF01840376
Efficient parallel algorithms for graph problems
105
TL;DR: An efficient technique for parallel manipulation of data structures that avoids memory access conflicts is presented and is used in a new parallel radix sort algorithm that is optimal for keys whose values are over a small range.
read more
Abstract: We present an efficient technique for parallel manipulation of data structures that avoids memory access conflicts. That is, this technique works on the Exclusive Read/Exclusive Write (EREW) model of computation, which is the weakest shared memory, MIMD machine model. It is used in a new parallel radix sort algorithm that is optimal for keys whose values are over a small range. Using the radix sort and known results for parallel prefix on linked lists, we develop parallel algorithms that efficiently solve various computations on trees and “unicycular graphs.” Finally, we develop parallel algorithms for connected components, spanning trees, minimum spanning trees, and other graph problems. All of the graph algorithms achieve linear speedup for all but the sparsest graphs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Ligra: a lightweight graph processing framework for shared memory
Julian Shun,Guy E. Blelloch +1 more
- 23 Feb 2013
TL;DR: This paper presents a lightweight graph processing framework that is specific for shared-memory parallel/multicore machines, which makes graph traversal algorithms easy to write and significantly more efficient than previously reported results using graph frameworks on machines with many more cores.
964
•Book
Deterministic coin tossing with applications to optimal parallel list ranking
Richard Cole,Uzi Vishkin,Uzi Vishkin +2 more
- 22 Aug 2011
TL;DR: The algorithms apply a novel “random-like” deterministic technique that provides for a fast and efficient breaking of an apparently symmetric situation in parallel and distributed computation.
518
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
TL;DR: The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence of m decrease_key and n delete_min operations takes time O(m + n log n).
235
A scalable method for run-time loop parallelization
TL;DR: A new run-time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires synchronization to ensure that the iterations are executed in the correct order.
A parallel algorithm for computing minimum spanning trees
Donald B. Johnson,Panagiotis Takis Metaxas +1 more
- 01 Jun 1992
TL;DR: A simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph G = (V;E) of n = jV j vertices andm = jEj edges on an EREW PRAM in O(log3=2n) time using n+m processors is presented.
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Parallel Prefix Computation
TL;DR: A recurstve construction is used to obtain a product circuit for solving the prefix problem and a Boolean clrcmt which has depth 2[Iog2n] + 2 and size bounded by 14n is obtained for n-bit binary addmon.
Finding Minimum Spanning Trees
TL;DR: This paper studies methods for finding minimum spanning trees in graphs and results include relationships with other problems which might lead general lower bound for the complexity of the minimum spanning tree problem.
465
The Complexity of Parallel Computations
James Christopher Wyllie
- 01 Jan 1979
TL;DR: This thesis describes an algorithm for the off-line MIN that organizes its computation in the form of a complete binary tree that relies on redundancy in its representation of the input graph, and introduces three techniques that permit the design of parallel algorithms that are efficient in terms of both their time and processor requirements.
Related Papers (5)
Yossi Shiloach,Uzi Vishkin +1 more
Joseph JaJa
- 01 Oct 1992
[...]
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974