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
Book ChapterDOI
Parallel computation: models and complexity issues
Raymond Greenlaw,H. James Hoover +1 more
TL;DR: This chapter is an introduction to the area of parallel computation written in accordance with the guidelines for the CRC HANDBOOK on algorithms and theory of computing where it will appear.
Proceedings ArticleDOI
Automatic remote-sensing images registration by matching close-regions
TL;DR: A new algorithm is developed that takes full advantage of the shape information of the close-regions bounded by contours after detecting and linking the edges in images and extends the sequential algorithm to a distributed scheme and performs the registration task more efficiently.
Dissertation
Approximate time-parallel simulation.
TL;DR: In classical parallel discrete-event simulation, the simulation state space is decomposed into a number of sub-spaces and the responsibility for the simulation of each sub-space is assigned to a separate parallel process and simulation is performed concurrently by the parallel processes.
Book ChapterDOI
Parallel Graph Algorithms for Coarse-Grained Multicomputers
TL;DR: This chapter presents the CGM model and discusses several CGM scalable parallel algorithms to solve some basic graph problems, including connected components and list ranking.
Workload Aware Algorithms for Heterogeneous Platforms
Kishore Kothapalli,Sivaramakrishna Bharadwaj Indarapu,Shashank Sharma,Dip Sankar Banerjee,Rohit Nigam +4 more
TL;DR: A light-weight, low overhead, and completely dynamic framework that addresses the load balancing problem of heterogeneous algorithms and is applicable for workloads which have a few simple characteristics such as having a collection of largely independent tasks that are easily describable.
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.