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
Model-based Design of Embedded Systems by Desynchronization
TL;DR: The theorem ensures that one passed the correctness verification, the generated DPN of asynchronous pro- cesses (or actors) preserves the functional behavior of the original synchronous network and the derived DPN is deadlock-free and can be implemented with only finitely bounded buffers.
Analysis and Optimization of Task Granularity on the Java Virtual Machine.
TL;DR: In this paper, the authors provide a better understanding of task granularity for task-parallel applications running on a single Java Virtual Machine in a shared-memory multicore and present a new methodology to accurately and efficiently collect the granularity of each executed task, implemented in a novel profiler that collects carefully selected metrics from the whole system stack with low overhead.
Journal ArticleDOI
Parallel computation of the Burrows Wheeler Transform in compact space
TL;DR: This paper presents a PRAM CREW algorithm to build the Burrows-Wheeler Transform using O ( n lg n ) work, O ( lg 3 ₡ n / lg σ ) depth, and O (n lg ¬ σ) bits.
Journal ArticleDOI
Checking If There Exists a Monotonic Function That Is Consistent with the Measurements: An Efficient Algorithm
TL;DR: This paper extends an efficient parallelizable algorithm for solving the problem of whether a physical quantity y depends on the physical quantity x, i.e., y = f(x) for some function f( x), to a more general situation when both xi and yi are known with interval uncertainty.
Proceedings ArticleDOI
Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication
Prakash Ramanan,Ashita Nagar +1 more
TL;DR: Tight bounds hold for the class of two-pass algorithms that perform all the real number multiplications in the first pass, and a tight bound on the total communication cost as a function of qf is presented.
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.