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
Journal ArticleDOI
MAXIMUM ENTROPY AND INTERVAL COMPUTATIONS (September Notes on Summer Impressions)
TL;DR: In this article, the authors show that interval and maximum entropy methods not only do not compete, but they complement each other, and explain how they can be used to solve the same application problems.
Proceedings ArticleDOI
Work-time-optimal parallel algorithms for string problems
TL;DR: This work design worl{-time-optirnal algorithm for a number of string processing problems on the EREW-PRAM and the hypercuhe, which include string matching and two dimensional pattern matching.
Book ChapterDOI
TOTAL ECLIPSE: An Efficient Architectural Realization of the Parallel Random Access Machine
TL;DR: It is hard to imagine that parallel computing would be able to continue the increasing trend of computational performance without solving problems caused by inability of current architectures to hide the latency of shared memory accesses, lack of synchronicity in execution of computational threads as well as too weak models and low-level primitives of parallel computing.
Journal ArticleDOI
Network-Oblivious Algorithms
Gianfranco Bilardi,Andrea Pietracaprina,Geppino Pucci,Michele Scquizzato,Francesco Silvestri +4 more
TL;DR: In this paper, the authors propose a framework for the design and analysis of network oblivious algorithms, which can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities.
Book ChapterDOI
Solving Graph Theory Problems Using Reconfigurable Pipelined Optical Buses
Keqin Li,Yi Pan,Mounir Hamdi +2 more
TL;DR: This work solves a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system based on fast matrix multiplication and extreme value finding algorithms, and are currently the fastest 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.