Open AccessBook
An introduction to parallel algorithms
TLDR
This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.Abstract:
Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The emphasis is on the application of the PRAM (parallel random access machine) model of parallel computation, with all its variants, to algorithm analysis. Special attention is given to the selection of relevant data structures and to algorithm design principles that have proved to be useful. Features *Uses PRAM (parallel random access machine) as the model for parallel computation. *Covers all essential classes of parallel algorithms. *Rich exercise sets. *Written by a highly respected author within the field. 0201548569B04062001read more
Citations
More filters
Journal ArticleDOI
An optimal EREW PRAM algorithm for minimum spanning tree verification
TL;DR: A deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph is presented, a parallelization of King's linear time sequential algorithm for the problem.
Journal ArticleDOI
Shortest paths in digraphs of small treewidth. Part II: optimal parallel algorithms
TL;DR: These are the first parallel algorithms which achieve bounds for any class of graphs except trees, when the treewidth is a constant: computing a shortest path tree, or finding a negative cycle in O(log 2 n) time using O(n) work.
On the Power of Segmenting and Fusing Buses (Extended Abstract)
TL;DR: This paper investigates the contribution of the abilities of a reconfigurable bus-based model to segment and fuse buses and shows that the ability to fuse buses is the more crucial of the two.
Journal ArticleDOI
Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
TL;DR: The δ-relativeε-approximation method, developed for the CRCW variant of the PRAM parallel computation model, can be easily implemented to run in $O(\log n(\log\log n)^{d-1})$ time using linear work on an EREW PRAM.
Journal ArticleDOI
A time-optimal solution for the path cover problem on cographs
TL;DR: In this paper, it was shown that the problem of finding and reporting the smallest number of vertex-disjoint paths that cover the vertices of a graph can be solved time and work-optimally for cographs.
References
More filters
Book
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
TL;DR: This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Book
Computer Architecture and Parallel Processing
Kai Hwang,Faye A. Briggs +1 more
TL;DR: The authors have divided the use of computers into the following four levels of sophistication: data processing, information processing, knowledge processing, and intelligence processing.
Journal ArticleDOI
Data parallel algorithms
W. Daniel Hillis,Guy L. Steele +1 more
TL;DR: The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was previously thought.
Proceedings ArticleDOI
Parallelism in random access machines
Steven Fortune,James C. Wyllie +1 more
TL;DR: A model of computation based on random access machines operating in parallel and sharing a common memory is presented and can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines.
Journal ArticleDOI
The Parallel Evaluation of General Arithmetic Expressions
TL;DR: It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.