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
Journal ArticleDOI
Optimizing the matrix multiplication parallel algorithms on a distributed-memory mimd multiprocessor
TL;DR: In this paper, the authors proposed a distributed-memory MIMD architecture for matrix multiplication on a distributed memory multiprocessor, which can achieve a linear speed up with an increase in the number of processors, but in practice the speed up is much less, and in fact increasing a certain number may result in degradation of completion time.
Dissertation
List ranking on multicore systems
TL;DR: In this article, the authors revisited the implementation of parallel linked-list ranking algorithms on modern multicore processors and showed that the performance of these algorithms can be improved on modern GPUs.
Posted Content
Peformance Prediction for Coarse-Grained Locking: MCS Case.
TL;DR: In this paper, a simple stochastic analysis can predict the throughput of coarse-grained lock-based algorithms using CLH lock and MCS lock, which is a standard design pattern found in many concurrent data structures, such as hash tables or ordered containers.
Journal ArticleDOI
A parallel algorithm for de novo peptide sequencing
TL;DR: Tandem mass spec-trometry (MS/MS) provides an important tool to handleprotein identification problem and can be dealt with the de novo sequencing that computesthe amino acid sequence of the peptides directly from their MS/MS spectra.
Technical Report 2008-553 Time-Sensitive Computational Models with a Dynamic Time Component
Naya Nagy,Selim G. Akl +1 more
TL;DR: Computational problems in which it is very difficult to find out (read compute) what to do and when to do it prove once more, that it is impossible to define a universal computer.
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.