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
Proceedings ArticleDOI
The Euler tour technique and parallel rooted spanning tree
Guojin Cong,David A. Bader +1 more
TL;DR: New efficient algorithms are presented that find rooted spanning trees without using the Euler tour technique and incur little or no overhead over the underlying spanning tree algorithms and two new approaches that construct Euler tours efficiently when the circular adjacency list is not given.
Posted Content
Efficiently Testing T-Interval Connectivity in Dynamic Graphs
TL;DR: It is shown that two operations, binary intersection and connectivity testing, are available to solve the problems of deciding whether a given sequence of static graphs is T-interval connected for a given T, and that such operations are required to solve both problems.
Proceedings ArticleDOI
A library of basic PRAM algorithms and its implementation in FORK
TL;DR: A brief survey of Fork95, ancl describe the main components of PAD and report on the status of thelang-uage and library imd discuss further clevelopments.
Journal ArticleDOI
Portable and architecture independent parallel performance tuning using BSP
TL;DR: A call-graph profiling tool designed and implemented to analyse the efficiency of programs written in BSPlib uses the bulk synchronous parallel cost model, thus providing a mechanism for portable and architecture-independent parallel performance tuning.
Proceedings ArticleDOI
A PRAM-NUMA model of computation for addressing low-TLP workloads
TL;DR: This paper shows that integrating nonuniform memory access (NUMA) support to the PRAM implementation architecture can solve the problem of dealing with workloads with low thread-level parallelism (TLP) efficiently.
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.