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
Proceedings ArticleDOI
Parallel algorithms for the tree bisector problem and applications
TL;DR: In this paper, efficient parallel algorithms are proposed on the EREW PRAM for the single- source and all-pairs tree bisector problems and two O(log n) time single-source algorithms are proposing.
Journal ArticleDOI
When is the multiaffine image of a cube a convex polygon
Nam-Kiu Tsing,André L. Tits +1 more
TL;DR: In this paper, the authors give sufficient conditions under which the multiaffine image in the complex plane of an m-dimensional cube is a convex polygon and a third condition which is necessary and sufficient is then obtained.
Book ChapterDOI
Adapting parallel algorithms to the W-stream model, with applications to graph problems
TL;DR: These techniques give new insights on developing streaming algorithms and yield optimal algorithms (up to polylog factors) for several classical problems in the W-Stream model including sorting, connectivity, minimum spanning tree, biconnected components, and maximal independent set.
Proceedings ArticleDOI
Parallel algorithms for fast computation of normalized edit distances
Ömer Eğecioğlu,Maximilian Ibel +1 more
TL;DR: The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normalized edit distance problem and present a polylogrithmic O(log/sup 2/ n) time algorithm based on matrix multiplication which runs on a O(n/sup 6//log n) processor hypercube.
Book ChapterDOI
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton
Eric Goles,Pedro Montealegre +1 more
TL;DR: It is shown that the robust prediction is in NC for the two-dimensional, von Neumann neighborhood, strict majority automaton.
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.