Efficient parallel algorithms for graph problems

Clyde P. Kruskal, Larry Rudolph, Marc Snir

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)43-64
Number of pages22
JournalAlgorithmica (New York)
Volume5
Issue number1
StatePublished - 1990
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Efficient parallel algorithms for graph problems'. Together they form a unique fingerprint.

Cite this