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
Líneas de investigación en computer imagery
TL;DR: In el actualidad, la habilidad inherente de las personas de reconocer patrones en 2D and 3D that les permite percibir and procesar información of datos graficos in forma rapida y eficiente, is a habilita inherente of las people to reconocher patrones in 2D y 3D.
Proceedings ArticleDOI
How to avoid making the same Mistakes all over again: What the parallel-processing community has (failed) to offer the multi/many-core generation
TL;DR: It is timely for the parallel-processing community to take stock: What does the community have to offer the upcoming generation that will have to deal with parallelism for a much broader range of applications.
Proceedings Article
Maintaining Voronoi Diagrams in Parallel
TL;DR: In this article, an algorithm for maintaining the Voronoi diagram in parallel over time using only 0(1) time per event on a CREW PRAM with O(nrf1) processors is presented.
Journal ArticleDOI
Algoritma untuk matching pada sistem penulisan ulang ekspresi
TL;DR: An algorithm for matching process on such term in tree based on pattern matching is presented and linearize both given tree and pattern tree into string representation by using Euler technique and and apply prefix-sum to computers the rank of all linearized edge.
Journal ArticleDOI
Time-optimal tree computations on sparse meshes
TL;DR: The task of encoding and/or decoding n-node binary and ordered trees cannot be solved faster than Ω(log n) time even if the MMB has an infinite number of processors, and the task of reconstructing n- node binary trees from their traversais can be performed in O(1) time on the same architecture.
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.