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
Formal Metrics for Large-Scale Parallel Performance
Kenneth Moreland,Ron A. Oldfield +1 more
TL;DR: This position paper advocates using a rate-based model that has a concrete meaning relative to speedup and efficiency and that can be used to unify strong and weak scaling studies.
Proceedings ArticleDOI
Realizing Multioperations for Step Cached MP-SOCs
TL;DR: An architectural technique for implementing multioperations on step cached MP-SOCs even if the associativity of caches is limited is proposed, based on simple active memory units, faster memory modules, and small processor-level memory blocks called scratchpads.
Adaptive and Hybrid Algorithms: classification and illustration on triangular system solving ∗
Van-Dat Cung,Vincent Danjean,Jean-Guillaume Dumas,Thierry Gautier,Guillaume Huard,Bruno Raffin,Christophe Rapine,Jean-Louis Roch,Denis Trystram +8 more
TL;DR: A classification of the different notions of hybridization and a generic framework for the automatic hybridization of algorithms is proposed and the results of this generic framework are detailed on the example of the parallel solution of multiple linear systems.
Journal ArticleDOI
Tree-Based Parallel Algorithm Design
Gary L. Miller,Shang-Hua Teng +1 more
TL;DR: This method involves the use of uniform closure properties of certain classes of unary functions and optimal parallel algorithms are given for many computation tree problems which are important in parallel algebraic and numerical computation, and parallel code generation on exclusive read and exclusive write parallel random access machines.
Journal ArticleDOI
Randomized Multipacket Routing and Sorting on Meshes
Michael Kaufmann,Jop F. Sibeyn +1 more
TL;DR: In this paper, the problem of routing and sorting ond-dimensionaln×...× mesh connected computers was considered and randomized algorithms were proposed to solve it with (1+o(1))·max{2·d·n,k·n/2} communication steps.
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.