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
Dissertation
Power and performance studies of the explicit multi-threading (xmt) architecture
TL;DR: This dissertation is a first order validation of the claim that even under power/thermal constraints, ease-of-programming and competitive performance need not be conflicting objectives for a massively-parallel generalpurpose processor.
Parallel relational olap
Andrew Rau-Chaplin,Todd Eavis +1 more
TL;DR: New parallel algorithms for the computation of both the complete data cube and the partial data cube are presented and a model for distributed multi-dimensional indexing is proposed, with a particular emphasis upon coarse-grained, distributed memory parallel architectures.
Journal ArticleDOI
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Christoph Kessler,Jörg Keller +1 more
TL;DR: This work solves the mapping problem of tasks to SPEs on the Cell BE with an integer linear programming formulation that allows to compute Paretooptimal mappings for smaller task graphs, general heuristics, and a problem speci c approximation algorithm.
Journal ArticleDOI
A PRAM oriented programming system
TL;DR: In this article, a PRAM-oriented programming language called 11 and its implementation on transputer networks are presented, where the approach taken is a compromise between efficiency and simplicity, and a method for the complexity analysis of 11 programs called PRSW is introduced.
Book ChapterDOI
Partitioned Parallel Radix Sort
TL;DR: A new parallel radix sorter is presented that solves the communication problem of balanced radix sort, called partitioned parallel radIX sort, and reduces the communication time by eliminating the redistribution steps.
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.