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 language | English (US) |
|---|---|
| Pages (from-to) | 43-64 |
| Number of pages | 22 |
| Journal | Algorithmica (New York) |
| Volume | 5 |
| Issue number | 1 |
| State | Published - 1990 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Computer Science
- Computer Science Applications
- Applied Mathematics