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
Journal ArticleDOI
On the parallel complexity of loops
TL;DR: A theoretical analysis using the PRAM complexity theory is given to give a theoretical analysis whether one can build a “general” compiler which is able to produce an efficient parallel algorithm for every instance of a nested loop.
Journal ArticleDOI
Constant-time RMESH algorithms for the range minima and co-minima problems
TL;DR: The authors' preprocessing algorithms for both problems take constant time on an n × n RMESH, and a query can be answered in constant time using a single processor.
Proceedings ArticleDOI
Some optimal parallel algorithms on weighted cographs
Ming-Shing Yu,Chuan-Ming Liu +1 more
TL;DR: An O(n) time sequential algorithm and a parallel algorithm of O( log n) time and O( n/log n) processors on the EREW PRAM model to solve the maximum weight independent set problem on weighted cographs is presented.
Book ChapterDOI
An I/O Efficient Algorithm for Minimum Spanning Trees
Alka Bhushan,G. Sajith +1 more
TL;DR: The algorithm can compute the connected components too, for the same number of I/Os, which is an improvement on the best known upper bound.
Book ChapterDOI
Ultrafast Randomized Parallel Construction- and Approximation Algorithms for Spanning Forests in Dense Graphs
TL;DR: A first randomized time and work CRCW-PRAM algorithm for finding a spanning forest of an undirected dense graph with $n$ vertices and is optimal with respect to time, work and space.
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.