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
The complexity of parallel prefix problems on small domains
TL;DR: The main result is that for an input of n bits, solving the chaining problem using O ( n ) processors requires inverse-Ackerman time, which matches the previously known upper bound.
Book ChapterDOI
3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM
Shih-Ying Lin,Shi-Jinn Horng,Tzong-Wann Kao,Chin-Shyurng Fahn,Pingzhi Fan,Cheng-Ling Lee,Anu G. Bourgeois +6 more
TL;DR: The proposed parallel algorithm can be run in O(logN) time using N3processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively.
Parallel Natural Language Parsing: From Analysis to Speedup
TL;DR: The research in this thesis focuses on parallel parsing, and investigates a parser for a different grammar (LinGO) at a later stage of the project.
Book ChapterDOI
Graph Algorithms on the Linear Array with a Reconfigurable Optical Bus
TL;DR: Several fast graph algorithms are proposed on the LarpBS model by exploiting several basic data movement operations previously designed for the LARPBS model, showing all these graph algorithms not only have better time complexities than the best algorithms on other realistic models such as the hypercube and arrays with reconfigurable electronic buses, but also use fewer processors.
Journal ArticleDOI
A strict functional language with cyclic recursive data
TL;DR: A strict functional language to program with cyclic recursive data structures and an operational semantics and a polymorphic type system for the language are given, and a type soundness proof is sketched.
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.