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. 0201548569B04062001read more
Citations
More filters
Book ChapterDOI
An O(n) Algorithm for Realizing Degree Sequences
TL;DR: This work presents an O(n)-time sequential algorithm to realize d, i.e., to compute the graph G, such that the components of d are equal to the degrees of the vertices of G.
Language and library support for practical PRAM programming
TL;DR: This project investigates the well-known Parallel Random Access Machine (PRAM) model of parallel computation as a practical parallel programming model, and develops a general-purpose PRAM programming language and library, called Fork95, and a library of fundamental, efficiently implemented parallel algorithms and data structures.
Journal ArticleDOI
A Parallel Implementation for the Negative Cost Girth Problem
Matthew Williamson,K. Subramani +1 more
TL;DR: This paper discusses the implementation of a new parallel algorithm for solving the negative cost girth (NCG) problem, and conducts an empirical analysis for both the parallel implementation, using MPI, and the corresponding sequential NCG implementation.
Journal ArticleDOI
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
TL;DR: It is shown that the computation of a doubly perfect elimination ordering in a doubably chordal graph with n vertices and m edges can be done in O(log2 n) time using O(n + m) processors on the CRCW PRAM model.
Parallel Algorithms for the All-Sources Generalized Shortest Paths Problem
Jeffrey D. Oldham,Vaughan Pratt +1 more
TL;DR: This work presents parallel algorithms for the all-sources generalized shortest paths problem using Floyd-Warshall and matrix multiplication algorithms and monotonic piecewise-linear functions.
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.