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
Journal ArticleDOI
On parallel block algorithms for exact triangularizations
TL;DR: A new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field using fast matrix multiplication, which has the best known sequential arithmetic complexity.
Journal ArticleDOI
A time- and cost-optimal algorithm for interlocking sets-with applications
Stephan Olariu,Albert Y. Zomaya +1 more
TL;DR: A time- and cost-optimal solution to a restricted version of the single row routing problem and shows that any sequential algorithm that computes the maximal interlocking sets of a family of n intervals must take /spl Omega/(n log n) time in the algebraic tree model.
Proceedings ArticleDOI
Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs
S. Chen,John H. Reif +1 more
TL;DR: The sorting algorithm hashes the key (rather than compare entire keys as in comparison sorts such as quicksort), which makes it even more advantageous in the case of large key lengths; in that case the cutoff is much lower.
Proceedings ArticleDOI
Parallel and distributed meldable priority queues based on binomial heaps
TL;DR: The hypercube algorithm, attains a nearly optimal amortized speed-up for the Insert, Extract-Min and Union operations, which exploits its natural similarity with the problem of adding two binary integers.
Proceedings ArticleDOI
An investigation of JPEG image and video compression using parallel processing
G.W. Cook,Edward J. Delp +1 more
TL;DR: This paper addresses one aspect of the parallel implementation of the JPEG still image compression standard on the MasPar MP-1, a massively parallel SIMD computer and develops a novel byte alignment algorithm used to efficiently output compressed data from the parallel system.
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.