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
Enhanced cluster k-ary n-cube, a fault-tolerant multiprocessor
Baback A. Izadi,Füsun Özgüner +1 more
TL;DR: A strongly fault-tolerant design for the k-ary n-cube multiprocessor that can tolerate significantly more faulty nodes with a low overhead and no performance degradation is presented.
Proceedings ArticleDOI
NSF supported projects: parallel computation as an integrated component in the undergraduate curriculum in computer science
Journal ArticleDOI
Easy PRAM-Based High-Performance Parallel Programming with ICE
TL;DR: ICE is a new parallel programming language that is easy-to-program, since it is a synchronous, lock-step language so there is no need for programmer-specified synchronization, and the PRAM algorithmic theory offers unique wealth of parallel algorithms and techniques.
Book ChapterDOI
List Ranking on Interconnection Networks
TL;DR: The list-ranking problem is considered for parallel computers which communicate through an interconnection network and an easy randomized algorithm gives a considerable improvement over earlier ones.
Journal ArticleDOI
An optimal parallel solution for the path cover problem on P4-sparse graphs
TL;DR: It is shown that the path cover problem on P"4-sparse graphs can also be optimally solved, and an optimal parallel algorithm is described which returns a minimum path cover of G in O( logn) time using O(n/logn) processors on the EREW PRAM model.
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.