Parallel algorithms for regular architectures : meshes and pyramids
Author(s)
Bibliographic Information
Parallel algorithms for regular architectures : meshes and pyramids
MIT Press, c1996
Available at 30 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Bibliography: p. [289]-310
Description and Table of Contents
Description
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. Algorithms are given to solve fundamental tasks such as sorting and matrix operations, as well as problems in the field of image processing, graph theory, and computational geometry. The first chapter defines the computer models, problems to be solved, and notation that will be used throughout the book. It also describes fundamental abstract data movement operations that serve as the foundation to many of the algorithms presented in the book. The remaining chapters describe efficient implementations of these operations for specific models of computation and present algorithms (with asymptotic analyses) that are often based on these operations. The algorithms presented are the most efficient known, including a number of new algorithms for the hypercube and mesh-of-trees that are better than those that have previously appeared in the literature.
The chapters may be read independently, allowing anyone interested in a specific model to read the introduction and then move directly to the chapter(s) devoted to the particular model of interest. Russ Miller is Assistant Professor in the Department of Computer Science, State University of New York at Buffalo. Quentin F. Stout is Associate Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan. Parallel Algorithms for Regular Architectures is included in the Scientific Computation series, edited by Dennis Gannon.
Table of Contents
- Part 1 Overview: models of computation
- forms of input
- problems
- data movement operations
- sample algorithms
- further remarks. Part 2 Fundamental mesh algorithms: definitions
- lower bounds
- primitive mesh algorithms
- matrix algorithms
- algorithms involving ordered data
- further remarks. Part 3 Mesh algorithms for images and graphs: fundamental graph algorithms
- connected components
- internal distances
- convexity
- external distances
- further remarks. Part 4 Mesh algorithms for computational geometry: preliminaries
- the convex hull
- smallest enclosing figures
- nearest point problem
- line segments and simple polygons
- intersection of convex sets
- diameter
- iso-oriented rectangles and polygons
- voronoi diagram
- further remarks. Part 5 Tree-like pyramid algorithms: definitions
- lower bounds
- fundamental algorithms
- image algorithms
- further remarks. Part 6 Hybrid pyramid algorithms: graphs as unordered edges
- graphs as adjacency matrices
- digitized pictures
- convexity
- data movement operations
- optimality
- further remarks.
by "Nielsen BookData"