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
An adjustable linear time parallel algorithm for maximum weight bipartite matching
TL;DR: This is the fastest known strongly polynomial parallel algorithm to solve the maximum weight bipartite matching problem with an adjustable time complexity of O(n/ω) using O( nmax(2ω,4+ω) processing elements for ω ≥ 1.
Journal ArticleDOI
Practical Wavelet Tree Construction
TL;DR: New sequential and parallel algorithms for wavelet tree construction based on a new bottom-up technique that can compute all auxiliary information solely based on the information obtained from computing the leaves are presented.
Dissertation
Parallelisation of hybrid metaheuristics for COP solving
TL;DR: This thesis presents an approximation parallel hybrid algorithm based on a greedy algorithm, a Lagrangian relaxation algorithm and a genetic algorithm which produces both lower and upper bounds for flow-based formulations of Survivability Network Design Problems.
Proceedings ArticleDOI
A time-optimal solution for the path cover problem on cographs
TL;DR: It is shown that the notoriously difficult problem of finding and reporting the smallest number of vertex-disjoint paths that cover the vertices of a graph can be solved time- and work-optimally for cographs.
Proceedings ArticleDOI
Efficient parallel solutions of linear algebraic circuits
Yosi Ben-Asher,Gadi Haber +1 more
TL;DR: It follows that using matrix multiplications alone is not sufficient for obtaining a “fully” efficient (O(n) work) parallel solution, even for evaluating LACs, so a CREW PRAM algorithm is presented which, during execution, propagates computed values into future matrix products, and uses a special scheduling of the Matrix multiplications to reduce constant factors of the execution time.
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.