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
Journal ArticleDOI
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM
TL;DR: An efficient parallel algorithm to solve the single function coarsest partition problem in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used.
Journal ArticleDOI
Parallel Partitioned Inverse Method for Least-Squares Adjustment
TL;DR: A parallel partitioned inverse algorithm is implemented and applied to a least-squares adjustment of horizontal survey networks to present the potential of parallel computing methods for surveying data and good scalability and better partitioning approach with the improved speed.
Journal Article
Efficient Algorithms for Finding a Tree 3-Spanner on Permutation Graphs
TL;DR: A tree 3-spanner T of a permutation graph G is a spanning tree of G such that the distance between any two vertices in T is at most 3 times of their distance in G as discussed by the authors.
Proceedings ArticleDOI
Ec - a compiler for the e-language [NOC applications]
TL;DR: In this article, a fine-grained thread-level parallel (TLP) programming language for synchronous shared memory NOC architectures, realizing the parallel random access machine, (PRAM) model, is introduced.
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems.
Sibabrata Ray,Hong Jiang +1 more
TL;DR: This paper considers the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs that stem from common computation schemes such as pipelining, iterative calculation etc..
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.