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
Posted Content
Algorithms in the Ultra-Wide Word Model
TL;DR: In this paper, the Ultra-Wide Word architecture and model, an extension of the word-RAM model that allows for constant time operations on thousands of bits in parallel, is introduced.
Proceedings ArticleDOI
Algorithms for stable sorting to minimize communications in networks of workstations and their implementations in BSP
TL;DR: A novel approach to produce BSP (Bulk Synchronous Programming model) programs and their efficiency is shown by implementing the stable sorting problem on clusters of PC by using derivatives of Shellsort and new code based on Quicksort.
Journal ArticleDOI
Parallel evaluation of arithmetic circuits
Nathalie Revol,Jean-Louis Roch +1 more
TL;DR: A generic algorithm designed for the parallel evaluation of arithmetic circuits is given that can be used in the domain of VLSI design, in order to get tight upper bounds on the computing time of a circuit, and its efficiency is shown on particular cases.
Book ChapterDOI
Weighted and Unweighted Selection Algorithms for k Sorted Sequences
TL;DR: This work provides a novel EREW algorithm for weighted selection, running in O(log n log*n) time with optimal work, and proposes lower bounds and matching upper bounds for selection and weighted selection in a collection A of k, sorted sequences of combined length n.
Cip - catalogação na publicação
Lucinéia Heloisa,Aplicando o Conhecimento,I. Iochpe,Wrana Maria Panizzi,José Carlos Ferraz Hennemann,Pró-Reitor Adjunto,Philippe Olivier,Alexandre Navaux,Carlos Alberto Heuser +8 more
TL;DR: The experiments here described apply software fault injection techniques to validate information systems supported by distributed COTS DBMS to measure the dependability of the target DBMS, the cost of its recovery mechanisms and the real applicability of COTSDBMS in mission critical systems.
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.