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
Technical Report 2008-005 Collapsing the Hierarchy of Parallel Computational Models ∗
Stefan D. Bruda,Yuanqiao Zhang +1 more
TL;DR: This work contradicts the long held belief that the heavyweight models (namely, the Combining CRCW PRAM, the BSR, and the models with directed reconfigurable buses) form a hierarchy, showing that all of them are identical in computational power with each other.
Book ChapterDOI
Grundlagen der MIMD-Architekturen
TL;DR: In this article, the authors unterscheidet MIMD-Architekturen einerseits von Mehrprozessorsystemen, in denen eine zentrale Recheneinheit von einer Anzahl von Coprozessoren zur Durchfuhrung spezieller Aufgaben unterstutzt wird, and and anotherseits of den Anordnungen von Rechenelementen (RE-Arrays), in which the REs keine autonomen Pro
Journal ArticleDOI
Collapsing the hierarchy of parallel computational models
Stefan D. Bruda,Yuanqiao Zhang +1 more
TL;DR: It is shown that the Collision write conflict resolution rule is universal on models with reconfigurable buses (in the sense that complex conflict resolution rules such as Priority and Combining can be simulated with constant overhead by Collision).
Journal ArticleDOI
Some directions and results of research in mathematical programming and system analysis
Proceedings ArticleDOI
Hybrid Parallel Bidirectional Sieve Based on SMP Cluster
Gang Liao,Lian Luo,Nian Che +2 more
TL;DR: This paper examines a new measure of bidirectional sieve in hybrid parallelism based on SMP Cluster, which is the individual computational units joined together by the communication network, are usually shared-memory systems with one or more multicore processors.
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.