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
Proceedings ArticleDOI
Parallel algorithm for wiring two-terminal nets in the knock-knee mode
TL;DR: A O(n log n) time serial algorithm that is able to wire all the two-terminal nets within (m/spl times/3n/2) layout area is given in the paper.
Book ChapterDOI
N-Cube String Matching Algorithm with Long Texts
TL;DR: A basic prefix-suffix matching technique is used as a building block in the construction of the algorithm which runs distributively on fixed N-cube and solves the string matching problem.
Posted Content
On Designing GPU Algorithms with Applications to Mesh Refinement.
TL;DR: The implementation of these algorithms shows that they are the first to run an order of magnitude faster than current state-of-the-art counterparts in sequential and parallel manners while using similar numbers of Steiner points to produce triangulations of comparable qualities.
Journal ArticleDOI
Data Parallel Implementation of Belief Propagation in Factor Graphs on Multi-core Platforms
TL;DR: This paper explores data parallelism for basic operations over the potential tables in belief propagation in acyclic factor graphs and proposes a complete belief propagation algorithm using these table operations to perform exact inference in factor graphs.
Proceedings ArticleDOI
Survey: Computational Models for Asymmetric Read and Write Costs
TL;DR: This survey reviews the existing computational models that measure the cost of operations and memory accesses to the NVMs, and scheduler of parallel algorithms on the new hardware, and lists some existing results on lower and upper bounds on the most common problems like sorting, searching, graph traversal based on these models.
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.