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
Posted Content
Efficient Parallel Graph Trimming by Arc-Consistency.
TL;DR: In this article, the authors proposed AC-4-based and AC-6-based graph trimming algorithms to reduce the search space by removing vertices without outgoing edges in a large data graph.
Near Optimal Randomized Initialization on the 1-Dimensional Reconfigurable Mesh
TL;DR: In this paper, a deterministic O(n log n log log n) time initialization algorithm for the 1-dimensional reconfigurable mesh with n processors is presented, with probability at least 1 − 1 for every real number f > 1.
Journal ArticleDOI
Extracting common subtrees from decision trees
TL;DR: This paper explores an efficient technique for the extraction of common subtrees in decision trees based on a Suffix Tree string matching process and the algorithm is applied to the problem of finding common decision rules in path planning.
Proceedings ArticleDOI
Sorting strings and constructing digital search trees in parallel
TL;DR: Two parallel sorting algorithms are described that solve the problem of determining a minimal starting point of a circular string with respect to lexicographic ordering and to construct a digital search tree for a given set of strings.
DissertationDOI
A configurable decoder for pin-limited applications
TL;DR: In this article , the authors propose a configurable decoder that selects subsets of an n-element set in a fast, focused and inexpensive manner, and demonstrate several implementations of the mapping unit with different capabilities and trade-offs.
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.