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 Article
PRO: a model for the design and analysis of efficient and scalable parallel algorithms
TL;DR: Experimental results on parallel algorithms designed using the PRO model--and implemented using its accompanying programming environment SSCRAP--demonstrate that the model indeed delivers efficient and scalable implementations on a wide range of platforms.
Journal ArticleDOI
Relating the power of the Multiple Associative Computing (MASC) model to that of reconfigurable bus-based models
TL;DR: This paper presents simulations between MASC and reconfigurable bus-based models, and extends the simulation results to further categorize the power of the MASC model in relation to RM and PRAM.
Proceedings ArticleDOI
Efficient parallel algorithms on distance-hereditary graphs
TL;DR: This work presents efficient parallel algorithms for finding a minimum weighted connected dominating set, a Minimum weighted Steiner tree for a distance-hereditary graph which take O(log n) time using O(n+m) processors on a CRCW PRAM.
Hybrid data-parallel contour tree computation
TL;DR: This work reports the first data-parallel algorithm for computing the fully augmented contour tree, using a quantised computation model, and extends this to provide a hybrid data-Parallel / distributed algorithm allowing scaling beyond a single GPU or CPU, and provides results for its computation.
Journal ArticleDOI
A time-optimal parallel algorithm for three-dimensional convex hulls
TL;DR: The algorithm presented here is the first parallel algorithm for the three-dimensional convex hull problem that is not based on the serial divide-and-conquer algorithm of Preparata and Hong, whose crucial operation is the merging of the convex Hulls of two linearly separated point sets.
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.