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 Article
Deterministic Computations on a PRAM with Static Processor and Memory Faults
TL;DR: In this paper, a deterministic simulation of a fully operational parallel random access machine (PRAM) on a similar faulty machine with constant fractions of faults among processors and memory cells is presented.
Proceedings ArticleDOI
The use of high performance computing in JPEG image compression
G.W. Cook,Edward J. Delp +1 more
TL;DR: The authors address the parallel implementation of the JPEG still image compression standard on the MasPar MP-1, a massively parallel SIMD computer and develop a parallel output algorithm which addresses this problem and present results which show real-time performance on 1024/spl times/1024 images.
Journal ArticleDOI
Models and resource metrics for parallel and distributed computation
TL;DR: A new parallel computation model is presented, the LogP-HMM model, which extends an existing parameterized network model with a sequential hierarchical memory model characterizing each processor, and captures both network communication costs and the effects of multileveled memory such as local cache and I/O.
Proceedings ArticleDOI
Parallel Depth-First Search for Directed Acyclic Graphs
TL;DR: This work proposes a novel work-efficient parallel algorithm for the DFS traversal of directed acyclic graph (DAG) that outperforms sequential DFS on the CPU by up to 6x in the authors' experiments.
Journal ArticleDOI
A fast Hough Transform algorithm for straight lines detection in an image using GPU parallel computing with CUDA-C
R. Yam-Uicab,J. L. López-Martínez,Joel Antonio Trejo-Sánchez,Joel Antonio Trejo-Sánchez,Hugo Hidalgo-Silva,S. Gonzalez-Segura +5 more
TL;DR: An optimized algorithm of HT for straight lines detection in an image is presented, allowing a reduction of total run time and achieving a performance more than 20 times better than the sequential method and up to 10 timesbetter than the implementation recently proposed.
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.