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

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry

TL;DR: In this article, the authors designed parallel algorithms for planar Delaunay triangulation, $k$-d trees, and static and dynamic augmented trees in the Asymmetric Nested-Parallel Model.

Overview of mesh results

TL;DR: An overview of lower and upper bounds for algorithms for mesh-connected processor networks for multicomputer routing and sorting problems from 1977 to 1995 is provided.
Posted Content

Online Tensor Methods for Learning Latent Variable Models

TL;DR: In this article, an online tensor decomposition based approach for two latent variable modeling problems namely, (1) community detection, in which they learn the latent communities that the social actors in social networks belong to, and (2) topic modeling, which they infer hidden topics of text articles.
Proceedings ArticleDOI

An ear-decomposition based approach for survivable routing in WDM networks

TL;DR: This work proposes an efficient survivable routing approach, which is based on the technique of ear-decomposition, to create protected routing of the embedded logical topology that can withstand a physical link failure.
Journal ArticleDOI

Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

TL;DR: Experimental results are shown that irregular parallel algorithms with efficient fine-grained synchronization may yield good performance on two shared-memory multiprocessors, the IBM pSeries 570 and the Sun Enterprise 4500.
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.