Parallel Algorithms for Irregularly Structured Problems Third International Workshop, IRREGULAR '96, Santa Barbara, CA, USA, August 19 - 21, 1996. Proceedings

This book constitutes the refereed proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '96, held in Santa Barbara, California, in August 1996. The volume presents 28 revised full papers selected from 51 submissions; also included...

Full description

Bibliographic Details
Other Authors: Ferreira, Alfonso (Editor), Rolim, Jose (Editor), Saad, Yousef (Editor), Yang, Tao (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1996, 1996
Edition:1st ed. 1996
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • On the complexity of the generalized block distribution
  • Adaptive load balancing of irregular applications a case study: IDA* applied to the 15-puzzle problem
  • Manufacturing progressive addition lenses using distributed parallel processing
  • The parallel complexity of randomized fractals
  • A simple parallel algorithm for the single-source shortest path problem on planar digraphs
  • A regular VLSI array for an irregular algorithm
  • Digital librarires and spatial information processing
  • Flexible communication mechanisms for dynamic structured applications
  • Multi-Message Multicasting
  • Synchronization as a strategy for designing efficient parallel algorithms
  • Supporting dynamic data and processor repartitioning for irregular applications
  • Simple quantitative experiments with a sparse compiler
  • Using algorithmic skeletons with dynamic data structures
  • An interface design for general parallel branch-and-bound algorithms
  • Support for irregular computation in high performance Fortran
  • Efficient dynamic embedding of arbitrary binary trees into hypercubes
  • Practical dynamic load balancing for irregular problems
  • The module allocation problem: An average case analysis
  • Dynamically adapting the degree of parallelism with reflexive programs
  • Allocating independent tasks to parallel processors: An experimental study
  • Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2
  • Solution of large, sparse, irregular systems on a massively parallel computer
  • Parallel implementation of a sparse approximate inverse preconditioner
  • Decomposing irregularly sparse matrices for parallel matrix-vector multiplication
  • Dynamic spectral partitioning
  • Fast distributed genetic algorithms for partitioning uniform grids
  • Toward efficient unstructured multigrid preprocessing (extended abstract)
  • Domain decomposition for particle methods on the sphere
  • Coordination of distributed/parallel multiple-grid domain decomposition
  • Systems support for irregular parallel applications
  • Distributed object oriented data structures and algorithms for VLSI CAD
  • Parallel progressive radiosity with adaptive meshing
  • Lineal feature extraction by parallel stick growing