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
Multi-core Portability Abstraction
Martti Forsell,Mikko Hiivala +1 more
TL;DR: The Multi-Core Portability Abstraction (MCPA) is introduced, simplifying portability and implementation of parallel applications making use of shared memory and acts as an executable intermediate abstraction/reference implementation as well as a tool for analyzing the intrinsic parallelism of the application and relative goodness of architectures in executing it.
Posted ContentDOI
SplitMEM: Graphical pan-genome analysis with suffix skips
TL;DR: This paper introduces a novel O(n log n) time and space algorithm called splitMEM, that directly constructs the compressed de Bruijn graph for a pan-genome of total length n, and augment the suffix tree with suffix skips, a new construct that allows us to traverse several suffix links in constant time.
Journal ArticleDOI
Very fast parallel algorithms for approximate edge coloring
TL;DR: It is shown that a graph with n vertices and m edges can be edge colored with 2 colors in O ( log log ∗ (n) time using O(m+n) processors on the EREW PRAM, where Δ is the maximum vertex degree of the graph and c is an arbitrarily large constant.
Posted Content
How hard is it to predict sandpiles on lattices? A survey
Kévin Perrot,Enrico Formenti +1 more
TL;DR: This survey is an attempt to formalize the intuitive notion of "behavioral complexity" that one easily observes in simulations, namely, the complexity of knowing, given a finite configuration and a cell in c, if cell x will eventually become unstable.
Journal ArticleDOI
Parallel algorithms column: on the search for suitable models
TL;DR: The role of parallel conlputing in commercial applications is expected to increase dramalically, as more and more users are demanding access to databases and dala warehouses conta.ining hundreds of gigabytes to terabytes of data.
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.