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
Book ChapterDOI
CHAPTER 9 – A Cursory Look at Parallel Architectures and Biologically Inspired Computing
Posted Content
Simplified, stable parallel merging
TL;DR: The additional merge step of distinguished elements as found in previous algorithms is not necessary, thus simplifying the implementation and reducing constant factors, and by fixating the requirements to the binary search, the merge algorithm becomes stable, provided that the sequential merge subroutine is stable.
Journal ArticleDOI
Deleting keys of B-trees in parallel
TL;DR: This paper presents a parallel algorithm on the EREW PRAM that deletes keys in a B-tree in O(B(logk+logBn) time with k processors, which improves upon the previous algorithm by a factor of B.
Proceedings Article
Highly Fault-Tolerant Parallel Computation Extended Abstract*
TL;DR: The coded model of fault-tolerant computation in which the input and output of a computational device are treated as words in an errorcorrecting code is re-introduced and it is shown how coded computation can be used to self-correct many linear functions in parallel with arbitrarily small overhead.
Book ChapterDOI
A New Staircase Separator Theorem
TL;DR: An optimal O(logn) time parallel algorithm is derived for computing a k-perfect staircase separator, namely a set of staircase separators which partitions a set S of n axis-parallel, rectangles into k subsets of (almost) equal size.
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.