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
Finding a region with the minimum total L1 distance from prescribed terminals
TL;DR: In this paper, the authors presented an output-sensitive algorithm that finds a plane region R* such that, for any point p in R*, the total length of the k shortest rectilinear paths connecting p and the k terminals without passing through any obstacle is minimum.
Book ChapterDOI
Applications of a Numbering Scheme for Polygonal Obstacles in the Plane
Mikhail J. Atallah,Danny Z. Chen +1 more
TL;DR: An O(n log n) time, O( n) space algorithm that produces a desired matching for isothetic rectangles is developed, based on a numbering scheme for certain geometric objects and on several useful geometric observations.
Journal ArticleDOI
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
TL;DR: It is shown that the perfect domination problem can be solved in sequential linear-time on distance-hereditary graphs by sketching some regular property of the problem and it is also shown that it can be easily parallelized ondistance-hereditarian graphs.
Book ChapterDOI
Smart Systems and Simple Agents
Raymond Board,Peter Tinsley +1 more
TL;DR: This paper explores an alternative conjecture that the dynamic behavior of markets is often better interpreted as a collection of many heterogeneous, rule-of-thumb agents who are loosely-coupled in smart systems — much like the contrast of a single serial processor with global information versus parallel processors with limited communications.
Proceedings ArticleDOI
Parallel Algorithms for Summing Floating-Point Numbers
Michael T. Goodrich,Ahmed Eldawy +1 more
TL;DR: In this article, the problem of exactly summing n floating-point numbers is solved using parallel algorithms in PRAM, external-memory, and MapReduce models, and an experimental analysis is provided.
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.