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
Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic
Erich Kaltofen,Victor Y. Pan +1 more
TL;DR: It is shown that over a field of characteristic p the solution to a non-singular system of n linear equations in n unknows, with 2 ≤ p < n, can be computed in parallel with randomization simultaneously in O((log n)) time and a total work of O(max{αn, p}n× log n loglog n).
Posted Content
Parallel Exhaustive Search without Coordination
TL;DR: In this paper, the authors analyze parallel algorithms in the context of exhaustive search over totally ordered sets and show that non-coordinating algorithms can achieve a speedup of $9/8$ for two searchers, $4/3$ for three searchers and in general, a speed-up of $\frac{k}{4}(1+1/k)^2$ for any k\geq 1$ searchers.
Journal ArticleDOI
Fast parallel algorithm for distance transform
TL;DR: This work presents an O((log log N)/sup 2/) -time algorithm for computing the distance transform of an N /spl times/ N binary image, based on a novel deterministic sampling scheme and can be used for computing distance transforms for a very general class of distance functions.
Proceedings ArticleDOI
An efficient parallel algorithm for the single function coarsest partition problem
Joseph JaJa,Kwan Woo Ryu +1 more
TL;DR: An efficient parallel algorithm to solve the single function coarsest partition problem and efficient parallel algorithms to find a minimal starting point of a circular string with respect to lexicographic ordering and to sort lexicographically a list of strings of different lengths are presented.
On the Complexity of Counting Irreducible Components and Computing Betti Numbers of Algebraic Varieties
TL;DR: This thesis gives a uniform method for the two problems #CCC and #ICC of counting the connected and irreducible components of complex algebraic varieties and proves that the problem of deciding connectedness of a complex affine or projective variety given over the rationals is PSPACE-hard.
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.