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
Parallel prefix algorithms on the multicomputer
Li-Ling Hung,Yen-Chun Lin +1 more
TL;DR: A family of computation-efficient parallel prefix algorithms for message-passing multicomputers that provide the flexibility of choosing either less computation time or less communication time, depending on the characteristics of the target machine, to achieve the minimal running time.
Additional Patterns for Parallel Application Programs
TL;DR: The overall structure of the pattern language is outlined and selected patterns from the group of patterns that represent different strategies for exploiting concurrency once it has been identified are presented.
Book ChapterDOI
Parallel Priority Queue and List Contraction: The BSP Approach
TL;DR: In this article, the authors present an extension of the randomized Parallel Priority Queue (PPQ) algorithm for the problem of list contraction on the Bulk-Synchronous Parallel (BSP) model.
A Fast Parallel Routing Algorithm for Benes Group Switches.
Enyue Lu,Si-Qing Zheng +1 more
TL;DR: A parallel routing algorithm for controlling the class of interconnection networks called group connectors is presented and can determine the switch setting of a Benes group connector with inputs and output groups in time on a completely connected computer or the EREW PRAM model with processing elements.
Posted Content
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
TL;DR: The best sequential algorithm is up to twice as fast as the currently fastest sequential wavelet tree construction algorithm (Shun [DCC, 2015]), simultaneously saving a factor of 2 in space, and an additional theoretical result shows how to adapt any wavelet Tree construction algorithm to the wavelet matrix in the same (asymptotic) time, using only little extra space.
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.