scispace - formally typeset
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. 0201548569B04062001

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

MVTsim: software simulator for multicore on chip parallel computer architectures

TL;DR: A software based simulator MVTsim for multi-core on chip parallel computers oriented towards supporting a very fine-grained moving threads approach and some initial results concerning running actual programs with the simulator are given.
Book ChapterDOI

Communication Efficient Parallel Searching

TL;DR: Deterministic and randomized multisearch algorithms that are very communication efficient are described that are developed for abstract parallel models like the PRAM.
Journal ArticleDOI

A new algorithm for computing orthogonal polynomials

TL;DR: The fast Fourier transform completes the connection given by Draux between the three-term recurrence relationship and the Euclidian algorithm and presents an algorithm for computing orthogonal polynomials.

Multiple bus networks for binary-tree algorithms

TL;DR: It is shown that optimal-time, degree-2, binary-tree MBNs require no less area than a balanced tree topology even though such MBNs can reuse buses over various steps of the algorithm.
Dissertation

View-Oriented Parallel Programming and its Performance Evaluation on Multicore Architectures

TL;DR: Wang et al. as discussed by the authors proposed a data race prevention scheme in the View-Oriented Parallel Programming (VOPP) paradigm, which can prevent data race through the memory protection mechanism while keeping the extra overhead low.
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, +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

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

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.