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
Fast parallel algorithms that compute transitive closure of a fuzzy relation
TL;DR: It is shown that on a parallel computer, transitive closure can be computed in time O((log(sub 2)(n))2).
Posted Content
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective.
TL;DR: This paper presents a sequential and parallel algorithm for enumerating all Perfect Elimination Orderings of a chordal graph and presents a parallel algorithms for spanning tree enumeration using O(2^n) processors.
Proceedings ArticleDOI
Parallel Implementation of Dynamic Programming Problems Using Wavefront and Rank Convergence with Full Resource Utilization
TL;DR: This paper is using rank convergence for computation of each stage ensuring full processor utilization to compute a particular class of dynamic programming problems parallelly, including algorithms such as Longest Common Subsequence and Needleman-Wunsch.
Journal ArticleDOI
A new algorithm for the Integer Knapsack Problem and its parallelization
Félix César García López,Francisco Almeida Rodriguez,José Luis García,Domingo Morales González,Celso Rodríguez Fernández +4 more
TL;DR: A new sequential algorithm with complexityO(M2+n) for an Integer Knapsack Problem with capacityM andn objects is proposed and computational results on both a local area network and a transputer network are reported.
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.