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
Book ChapterDOI
Shared Memory Simulations with Triple-Logarithmic Delay
TL;DR: A randomized algorithm that simulates each step of an n-processor CRCW PRAM on an n -processor DMM with \(\mathcal{O}\)log log log n log*n) delay, with high probability, which is an exponential improvement on all previously known simulations.
Journal ArticleDOI
Edge-based identification of DP-features on free-form solids
Theodore Lim,H. Medellin,Carmen Torres-Sanchez,Jonathan Corney,James Millar Ritchie,J.B.C. Davies +5 more
TL;DR: A partitioning algorithm that first identifies the boundary edges of DP-features and then creates a surface patch to cover the depressions or isolate the protrusions is reported.
Journal ArticleDOI
Parallel volume meshing using face removals and hierarchical repartitioning
H. L. de Cougny,Mark S. Shephard +1 more
TL;DR: In this paper, a parallel volume meshing procedure whose input is a surface mesh (distributed or not) is presented and a distributed octree is built considering the surface mesh and meshing size attributes.
Book
Cognition and Intractability : A Guide to Classical and Parameterized Complexity Analysis
TL;DR: Cognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.
Proceedings ArticleDOI
Parallelism in Randomized Incremental Algorithms
TL;DR: In this article, it was shown that most sequential randomized incremental algorithms are in fact parallel, and the dependence structure is shallow for all of the algorithms, implying high parallelism, and three types of dependences found in the algorithms studied and presented a framework for analyzing each type of algorithm.
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.