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
An optimal parallel algorithm for node ranking of cographs
Chuan-Ming Liu,Ming-Shing Yu +1 more
TL;DR: A parallel algorithm which needs O(log n) time and n/log n processors on the EREW PRAM model for this problem of finding an optimal ranking on cographs is proposed.
Proceedings ArticleDOI
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
Joseph Cheriyan,John H. Reif +1 more
TL;DR: Output-sensitive parallel algorithms whose performance depends on the output size and are significantly more efficient tan previous algorithms for problems with sufficiently small output size are given.
Book ChapterDOI
Detecting False Matches in String Matching Algorithms
TL;DR: The complexity of two problems in this context is investigated, namely, checking if there is any false match, and identifying all the false matches in the match vector.
Automatic data and computation mapping for distributed-memory machines
TL;DR: It is this thesis that for many practical codes, it is possible to derive good mappings through a combination of algorithms and systematic procedures that have been used in efficient hand-coded implementations of several benchmark codes.
Journal ArticleDOI
Efficient parallel recognition of cographs
TL;DR: Structural properties for the class of complement reducible graphs or cographs are established, which enable us to describe efficient parallel algorithms for recognizing cographs and for constructing the cotree of a graph if it is a cographs; if the input graph is not a cograph, both algorithms return an induced P4.
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.