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
A full parallel Quicksort algorithm for multicore processors
TL;DR: This paper introduces ParaQuick, a full parallel quicksort algorithm for use on an ordinary shared memory multi core machine that has just a few simple statements in its sequential part, and can be seen as an improvement over traditional parallelization of the Quicksort algorithms.
Proceedings ArticleDOI
Parallel system module for prepare photorealistic rendering in grid and cluster
TL;DR: The focus of this article is on the speed of drawing the picture, while it's compared in the network interfaces grid and cluster, and the impressiveness of running the parallel program for the photorealistic drawing on two different networking interfaces is compared.
Posted Content
Parallel Batch-Dynamic k-Core Decomposition.
TL;DR: In this paper, the authors present a parallel batch-dynamic algorithm for maintaining an approximate $k$-core decomposition that is efficient in both theory and practice, given an initial graph with $m$ edges, and a batch of $B$ updates, their algorithm maintains a $(2 + \delta)$-approximation of the coreness values for all vertices (for any constant Δ > 0$) in $O(B\log^2 m)$ amortized work and $O(\log 2 m \log\log m)
Journal ArticleDOI
K-Dimensional Optimal Parallel Algorithm for the solution of a general class of recurrence equations
Qingshi Gao,Zhiyong Liu +1 more
TL;DR: This paper proposes a parallel algorithm, called KDOP (K-Dimensional Optimal Parallel algorithm), to solve a general class of recurrence equations efficiently, and can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems.
Book ChapterDOI
Enhanced File Interoperability with Parallel MPI File-I/O in Image Processing
TL;DR: 3 strategies namely, Normal File Reading, Off-line Conversion and Run-time Conversion for free format integer file reading and writing are implemented which will enhance the file interoperability and be useful for image processing community to use parallel systems to meet the real time constraints.
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.