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
PhD Thesis: View-Oriented Parallel Programming and its Performance Evaluation on Multicore Architectures
TL;DR: An automatic view access management scheme where a view is automatically acquired upon its first access, and automatically released when no longer needed, thus relieving programmers from arranging locks to protect critical sections is proposed.
DissertationDOI
Multiple Bus Networks for Binary -Tree Algorithms.
TL;DR: In this article , the authors study the relationship between running time, degree, and loading of binary-tree MBNs and derive three loading lower bounds, Wn , W&parl0;n23&parr0; and W&Parl0,nlogn&PARR0; , each tighter than the previous one, and show that if the degree is increased to 3 then the loading can be a constant.
Proceedings ArticleDOI
WECPAR: List Ranking Algorithm and Relative Computational Power
TL;DR: Several simulations algorithms are introduced between WECPAR and well-known models such as PRAM and RMBM and show that ranking one element in a list of N elements can be solved on W(N,N, N) WEC PAR in O(1) time.
Book ChapterDOI
Principles of Shared Memory Parallel Programming Using ParC
TL;DR: This chapter introduces the basic concepts of parallel programming and supplies the basic tools and concepts needed to write parallel programs and covers these topics: Practical aspects of threads, the sequential “atoms” of parallel programs.
Proceedings ArticleDOI
An approach for facilitating the development of visual simulations of parallel and distributed algorithms
TL;DR: This paper introduces a new approach to minimising the effort needed to create effective visual simulations of parallel and distributed algorithms.
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.