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
On the architectural requirements for efficient execution of graph algorithms
TL;DR: This paper considers the performance and scalability of two graph algorithms, list ranking and connected components, on two classes of shared-memory computers: symmetric multiprocessors such as the Sun Enterprise servers and multithreaded architectures (MTA)such as the Cray MTA-2.
Journal ArticleDOI
Two-tree algorithms for full bandwidth broadcast, reduction and scan
TL;DR: This work presents a new, simple algorithmic idea for the collective communication operations broadcast, reduction, and scan (prefix sums), which beats all previous algorithms for reduction and scan.
Proceedings ArticleDOI
A massively parallel adaptive fast-multipole method on heterogeneous architectures
Ilya Lashuk,Aparna Chandramowlishwaran,M. Harper Langston,Tuan-Anh Nguyen,Rahul S. Sampath,Aashay Shringarpure,Richard Vuduc,Lexing Ying,Denis Zorin,George Biros +9 more
TL;DR: New scalable algorithms and a new implementation of the kernel-independent fast multipole method are presented, in which both distributed memory parallelism and shared memory/streaming parallelism are employed to rapidly evaluate two-body non-oscillatory potentials.
Journal ArticleDOI
The REFINE multiprocessor—theoretical properties and algorithms
TL;DR: The REFINE multiprocessor is shown to offer a cost-effective alternative to the Boolean n-cube multiprocessionor architecture without substantial loss in performance.
Journal ArticleDOI
Causal maps: theory, implementation, and practical applications in multiagent environments
TL;DR: This work proposes a formal model for causal maps with a precise semantics based on relational algebra and investigates the issue of using this tool in multiagent environments by explaining through different examples how and why this tool is useful for the following aspects.
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.