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
Journal ArticleDOI
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
Maxime Crochemore,Leszek Gasieniec,Ramesh Hariharan,S. Muthukrishnan,S. Muthukrishnan,Wojciech Rytter +5 more
TL;DR: An alphabet-independent deterministic parallel algorithm for finding all occurrences of a pattern array of size mh x mw in a text array in the concurrent-read-concurrent-write--parallel-random-access-machine (CRCW--PRAM) model is given.
Journal ArticleDOI
Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions
TL;DR: The main result is in constructing nearly optimal randomized parallel algorithms for ToePlitz and Toeplitz-like computations and, consequently, for numerous related computational problems (including the computational problems listed above), where all the input values are integers and all the output values are computed exactly.
More Patterns for Parallel Application Programs
TL;DR: Three patterns from the pattern language are presented, selected from the set of patterns that are used after the problem has been analyzed to identify the exploitable concurrency, which addresses the question of how to select an appropriate pattern from the others in this set.
Journal ArticleDOI
Randomized parallel list ranking for distributed memory multiprocessors
Frank Dehne,Siang Wun Song +1 more
TL;DR: The algorithm has a considerably smaller member of communication rounds than the list ranking algorithm used in Reid-Miller’s empirical study of parallel list ranking on the Cray C-90, and is thought to be the fastest list ranking implementation so far.
Posted Content
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability
TL;DR: In this article, the authors present a randomized parallel algorithm for digraph reachability and related problems with expected work (i.e., the number of vertices reachable from a designated source vertex).
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.