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
Journal ArticleDOI
Parallel automatic adaptive analysis
Mark S. Shephard,Joseph E. Flaherty,Carlo L. Bottasso,H. L. de Cougny,Can Özturan,M. L. Simone +5 more
TL;DR: Considering is given to the techniques required to support adaptive analysis of automatically generated unstructured meshes on distributed memory MIMD parallel computers, and procedures to automatically generate and adaptively refine meshes in parallel are given.
Journal ArticleDOI
Parallel adaptive mesh refinement and redistribution on distributed memory computers
TL;DR: The procedure uses the mesh topological entity hierarchy as the underlying data structures to easily support the required adjacency information and is implemented on a massively parallel MasPar MP-1 system with a SIMD style of computation.
Proceedings ArticleDOI
Practical parallel algorithms for dynamic data redistribution, median finding, and selection
David A. Bader,Joseph JaJa +1 more
TL;DR: This paper presents a fast and portable parallel algorithm for finding the median given a set of elements distributed across a parallel machine that solves the general selection problem that requires the determination of the element of rank i, for an arbitrarily given integer i.
Book ChapterDOI
A highly-parallel TSP solver for a GPU computing platform
TL;DR: A novel method to solve TSP with a GPU based on the CUDA architecture that highly parallelizes a serial metaheuristic algorithm which is a genetic algorithm with the OX (order crossover) operator and the 2-opt local search.
Proceedings ArticleDOI
Parallel external memory graph algorithms
TL;DR: All the solutions on a P-processor PEM model provide an optimal speedup of Θ(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts.
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.