Open AccessBook
An introduction to parallel algorithms
Reads0
Chats0
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 ArticleDOI
Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity
Vladik Kreinovich,Gang Xiang,Scott A. Starks,Luc Longpre,Martine Ceberio,Roberto Araiza,Jan Beck,Raj Kandathi,Asis Nayak,Roberto Torres,Janos Hajagos +10 more
TL;DR: A survey of algorithms for computing various statistics under interval uncertainty and their computational complexity is provided in this article, where both known and new algorithms are presented, as well as their complexity.
Proceedings ArticleDOI
Highly fault-tolerant parallel computation
TL;DR: Any parallel computation that runs for time t on w processors can be performed reliably on a faulty machine in the coded model and it is shown how coded computation can be used to self-correct many linear functions in parallel with arbitrarily small overhead.
Proceedings ArticleDOI
Low-latency graph streaming using compressed purely-functional trees
TL;DR: Aspen as mentioned in this paper is a graph-streaming framework that extends the interface of Ligra with operations for updating graphs, which significantly improves on the space usage and locality of purely-functional trees.
On Parallel RRTs for Multi-robot Systems
Stefano Carpin,Enrico Pagello +1 more
TL;DR: This paper provides three different ways to better the performance of Rapidly-exploring Random Trees by implementing them over a parallel system to outline an optimal speed up.
Journal ArticleDOI
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
TL;DR: This work shows that if a flow network haskinput/output terminals, its external flow pattern has two characterizations of size independent of the total number of vertices: a set of 2k+1 inequalities inkvariables representing flow values at the terminals, and a mimicking network with at most 22kvertices and the same external flow patterns as the original network.
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.