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
A Range Minima Parallel Algorithm for Coarse Grained Multicomputers
H. Mongelli,Siang Wun Song +1 more
TL;DR: This work presents a parallel algorithm under the CGM model (Coarse Grained Multicomputer), that solves the range minima problem in O(n/p) time and constant number of communication rounds.
Posted Content
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
TL;DR: In this paper, a deterministic algorithm for the dynamic minimum spanning forest (MSF) problem in the EREW PRAM model was given, where the goal is to maintain a MSF of a weighted graph with $n$ vertices and $m$ edges while supporting edge insertions and deletions.
Posted Content
Basic Parallel and Distributed Computing Curriculum.
TL;DR: This paper presents a basic educational scenario on how to give a consistent and efficient background in parallel computing to ordinary computer scientists and engineers.
Journal ArticleDOI
Detecting False Matches in String-Matching Algorithms
TL;DR: An algorithm on the CRCW PRAM that checks if there exists a false match in O(1) time using O(n) processors is presented, and it is shown that string-matching algorithms take $\Omega(\log\log m)$ time even given the flexibility to output a few false matches.
Journal ArticleDOI
An Effective Load Balancing Policy for Geometric-Decaying Algorithms
Joseph Gil,Yossi Matias +1 more
TL;DR: This work presents a more effective, yet as simple, policy for the utilization of load balancing in geometric-decaying algorithms by making a more careful choice of when and how often load balancing should be employed, and by using a simple amortization argument.
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.