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
Proceedings ArticleDOI
High-speed crosstalk-free routing for optical multistage interconnection networks
Enyue Lu,Si-Qing Zheng +1 more
TL;DR: The permutation capacity of MINs is reexamine, a simpler proof for semipermutation decomposability is presented, and a parallel decomposition algorithm of logarithmic time is proposed that is useful for optimally routing crosstalk-free paths in optical Benes networks in high-speed.
Journal ArticleDOI
Optimal parallel two dimension text searching on a CREW PRAM4
TL;DR: This algorithm takes timeO(log m) on a CREW PRAM (where log m is the length of the longest dimension of the pattern), thus matching the lower bound for string matching on a PRAM without concurrent writes.
Journal ArticleDOI
Can parallel algorithms enhance serial implementation
TL;DR: This article presents a software-centric approach, in which ease of programming is a first priority for both uniprocessor computers as well as on parallel computers, and outlines two concrete reasons and one general reason why parallel programs could give a (modest) gain in performance over serial code on unipROcessors, especially with the current trends in unip rocessor architecture.
Book ChapterDOI
On Word-Level Parallelism in Fault-Tolerant Computing
TL;DR: Several simulations of operational PRAM on PRAM with memory or processor faults are presented, finding that their common property is that they rely on the ability of performing standard boolean or arithmetic operations on words consisting of many bits.
Journal Article
A unified approach to coding labeled trees
TL;DR: The problem of coding labeled trees by means of strings of node labels is considered and a unified approach based on a reduction of both coding and decoding to integer (radix) sorting is presented, solving the problem of optimally computing the second code presented by Neville.
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.