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
Proceedings ArticleDOI
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
TL;DR: This paper presents the first work-efficient parallel batch-dynamic algorithm for incremental MST, which can insert l edges in O(l log(1+n/l) work in expectation and O(polylog(n) span w.p.h.)), and demonstrates a range of applications that become efficiently solvable in parallel in the sliding-window model.
On the effective parallel programming of multi-core processors
TL;DR: In this article, a unitary framework for effective programming of multi-core processors, called MAP, is proposed to assist the programmer in application design, implementation, optimization, and performance analysis.
Journal ArticleDOI
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Markus Bläser,Christian Hoffmann +1 more
TL;DR: In this article, the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k was studied and an algorithm with running time f(k)?n, where f(n) is doubly exponential in k, was presented.
Book ChapterDOI
A Simple Work-Optimal Broadcast Algorithm for Message-Passing Parallel Systems
TL;DR: This note gives a simple bandwidth- and latency optimal algorithm for the problem of broadcasting m units of data from a distinguished root processor to all p–1 other processors in one-ported (hypercubic) message-passing systems.
Dissertation
A high-performance framework for analyzing massive complex networks
David A. Bader,Kamesh Madduri +1 more
TL;DR: This dissertation addresses the problem of analyzing large-scale complex networks that represent interactions between hundreds of thousands to billions of entities, and presents SNAP (Small-world Network Analysis and Partitioning), a new high-performance computational framework for efficiently processing graph-theoretic queries on massive datasets.
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.