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
Solving Cheap Graph Problems on Meshes
Michael Kaufmann,Jop F. Sibeyn +1 more
TL;DR: This paper presents an efficient mesh algorithm for finding the connected components, constructing a minimum spanning tree, or finding a path between a pair of vertices that is linear in n and m, where m is the number of edges.
Posted Content
Parallel Shortest-Paths Using Radius Stepping
TL;DR: Radius-Stepping (RS) as mentioned in this paper is an algorithm with a tradeoff between work and depth for SSSP with nonnegative edge weights that takes a sequence of steps, each increasing the radius by a user-specified value, each step settles the vertices in its annulus but can take $\Theta(n)$ substeps, each requiring $n$ work.
Proceedings ArticleDOI
AT2 bounds for a class of VLSI problems and string matching
Micah Adler,John W. Byers +1 more
TL;DR: It is proved that all transitive problems have regional mappings, as do a variety of interesting computational problems such as merging two sorted lists of arbitrary length, generalized integer multiplication and matrix-vector products.
Book ChapterDOI
Embedding properties of reconfigurable partitionable optical networks
TL;DR: This chapter describes the embedding properties of some emerging reconfigurable and partitionable optical networks, and motivates and formalizes several combinat ori al optimizat ion problems associated with embeddings in these networks.
Book ChapterDOI
Finding All Minimal Maximum Subsequences in Parallel
TL;DR: A generalization of the parallel cluster algorithm with improvements for input of arbitrary real-valued sequence, and an empirical study of the speedup and efficiency achieved by the parallel algorithm with synthetic normally-distributed random sequences 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.