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 Article
On the parallel time complexity of undirected connectivity and minimum spanning trees
TL;DR: This approach gives an algorithm that runs in O(log n) time using n + m processors on the EREW PRAM, settling a long-standing open problem in the literature.
Journal ArticleDOI
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
TL;DR: It is shown that a QT- graph G has a unique tree representation, that is, a tree structure which meets the structural properties of G, which relies on O(log n)-time parallel algorithms, which are developed here for constructing tree representations of aQT-graph.
Posted Content
Parallelism in Randomized Incremental Algorithms
TL;DR: It is shown that most sequential randomized incremental algorithms are in fact parallel, and three types of dependences found in the algorithms studied are identified and a framework for analyzing each type of algorithm is presented.
Proceedings ArticleDOI
Theoretically-Efficient and Practical Parallel In-Place Radix Sorting
TL;DR: The performance of Regions Sort is compared to existing parallel in-place and out-of-place sorting algorithms on a variety of input distributions and shown to be faster than optimized out- of-place radix sorting and comparison sorting algorithms.
Proceedings ArticleDOI
Buckets strike back: improved parallel shortest-paths
TL;DR: A new bucket-based parallel SSSP algorithm that runs in T=O(log2 n·mini{2i·L+|Vi|}) average-case time using O(n+m+T) work on a PRAM, where L denotes the maximum shortest-path weight and |Vi| is the number of graph vertices with in-degree at least 2i.
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.