Parallel Algorithms for Regular Architectures: Meshes and Pyramids

Parallel Algorithms for Regular Architectures: Meshes and Pyramids

by Russ Miller, Quentin F. Stout
     
 

View All Available Formats & Editions

ISBN-10: 0262132338

ISBN-13: 9780262132336

Pub. Date: 09/01/1996

Publisher: MIT Press

Parallel-Algorithms for Regular Architectures is the first book to concentrate exclusively on algorithms and paradigms for programming parallel computers such as the hypercube, mesh, pyramid, and mesh-of-trees.

Overview

Parallel-Algorithms for Regular Architectures is the first book to concentrate exclusively on algorithms and paradigms for programming parallel computers such as the hypercube, mesh, pyramid, and mesh-of-trees.

Product Details

ISBN-13:
9780262132336
Publisher:
MIT Press
Publication date:
09/01/1996
Series:
Scientific Computation Series
Pages:
328
Product dimensions:
6.28(w) x 9.49(h) x 0.95(d)

Table of Contents

1. Overview
Introduction
Models of Computation
Preliminaries
Classification Schemes
Mesh Computer
Pyramid Computer
MeshofTrees Architecture
Hypercube
PRAM
Forms of Input
Problems
Graph and Image Problems
Computational Geometry Problems
Data Movement Operations
Sample Algorithms
Component Labeling for Digitized Picture Input
ConveX Hull for Planar Point Data Input
Further Remarks
2. Fundamental Mesh Algorithms
Introduction
Definitions
Lower Bounds
Primitive Mesh Algorithms
Row and Column Rotations
Passing a Row (Column) Through a Mesh
Semigroup Operations, Reporting, and Broadcasting
Parallel PreliX
MatriX Algorithms
MatriX Transposition
MatriX Multiplication
Transitive Closure
MatriX Inverse
Algorithms Involving Ordered Data
Sorting
Rotating Data within Intervals
Semigroup Computation within Intervals
Concurrent Read and Concurrent Write
Compression
Further Remarks
3. Mesh Algorithms for Image Processing
and Graph Theory
Introduction
Fundamental Graph Algorithms
Bridge Edges
Articulation Points
Minimum Spanning Tree
Connected Components
Counting Connected Components
Labeling Connected Components
Internal Distances
ConveXity
EXternal Distances
Further Remarks
4. Mesh Algorithms for
Computational Geometry
Introduction
Preliminaries
Initial Conditions
Lower Bounds
Fundamental Operations on the Mesh
The ConveX Hull
Smallest Enclosing Figures
Nearest Point Problems
Line Segments and Simple Polygons
Intersection of ConveX Sets
Diameter
Isooriented Rectangles and Polygons
VoronoiDiagram
Algorithm
Applications
Further Remarks
5. Treelike Pyramid Algorithms
Introduction
Definitions
Lower Bounds
Fundamental Algorithms
Initializing Identity Registers
Bit Counting Problems
Commutative Associative Binary Functions
Point Queries
Image Algorithms
ConveXity Properties
Digitized Straight Line Segments
Further Remarks
6. Hybrid Pyramid Algorithms
Introduction
Graphs as Unordered Edges
Data Movement Operations
Component Labeling
Minimal Spanning Forests
Graphs as Adjacency Matrices
Data Movement Operations
Component Labeling/Minimal Spanning Forests
Digitized Pictures
Data Movement Operations
Component Labeling
Nearest Neighbors
ConveXity
Data Movement Operations
Enumerating EXtreme Points
Applications of EXtreme Points
Data Movement Operations
Pyramid Read, Pyramid Write, and Count_keys
Pyramid MatriX Read and Pyramid MatriX Write
Funnel Read and Reducing a Function
Optimality
Further Remarks
Order Notation
Recurrence Equations

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >