Open AccessBook
An introduction to parallel algorithms
Reads0
Chats0
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
Proceedings ArticleDOI
Fully-scalable fault-tolerant simulations for BSP and CGM
Sung-Ryul Kim,Kunsoo Park +1 more
TL;DR: This paper presents a deterministic simulation that achieves constant slowdown per local computations and O(log/sub h/ p)/sup 2/) slowdown per communication round, and implies that for p/spl les/n/sup /spl epsi// (/ spl epsiv/<1), algorithms can be made resilient to a constant fraction of processor faults without any asymptotic slowdown.
Book ChapterDOI
Routing on the PADAM: Degrees of Optimality
TL;DR: In this article, the authors studied the optimal performance of the Parallel Alternating-Direction Access Machine (PADAM) for the case of moderate loads and showed that it is optimal to within a small multiplicative constant.
Book ChapterDOI
Approximate String Matching with Don't Care Characters
TL;DR: This paper presents parallel and serial approximate matching algorithms for strings with don't care characters based on Landau and Vishkin's approximate string matching algorithm and Fisher and Paterson's exact string matching algorithms with don's care characters.
A parallel algorithm for transitive closure
TL;DR: A parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges is presented, using the BSP/CGM model of parallel computing.
Book ChapterDOI
Efficient Parallel Algorithms for Geometric k-Clustering Problems
TL;DR: Efficient parallel algorithms for two geometric k-clustering problems in the CREW PRAM model of parallel computation to find a k-point subset such that some measure for this subset is minimized are presented.
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.