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

Revisiting a BSP/CGM transitive closure algorithm

TL;DR: The algorithm was implemented and the results show the efficiency and scalability of the presented algorithm and compare favorably with other parallel implementations.
Book ChapterDOI

Solving Cheap Graph Problems an Meshes

TL;DR: In this article, the authors present an algorithm for finding the connected components, constructing a minimum spanning tree, and finding a path between a pair of vertices in O(n) time on a graph with n vertices.

Concurrent Algorithms and Data Structures for Many-Core Processors

TL;DR: This thesis presents the first efficient design of Quicksort for graphics processors and shows that it performs well in comparison with other available sorting methods, and present the first application of software transactional memory to graphics processors.
Posted Content

Straight--Line Programs in Geometric Elimination Theory

TL;DR: In this article, the authors present a method for solving symbolically zero-dimensional polynomial equation systems in the affine and toric case using arithmetic networks and straight-line programs.
Book ChapterDOI

A Theoretical Application of Feedback Guided Dynamic Loop Scheduling

TL;DR: The feedback-guided dynamic loop scheduling (FGDLS) algorithm as mentioned in this paper uses a feedback mechanism, based on measured execution times, to schedule a parallel loop within a sequential outer loop.
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.