Parallel algorithms for irregular problems : state of the art

Bibliographic Information

Parallel algorithms for irregular problems : state of the art

edited by Afonso Ferreira, José D.P. Rolim

Kluwer Academic Publishers, 1995

Available at  / 15 libraries

Search this Book/Journal

Note

Papers from a workshop and summer school held in Geneva in 1994

Includes bibliographical references

Description and Table of Contents

Description

Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop and summer school organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This book, which is based on the workshop, draws on the contributions of outstanding scientists to present the state of the art in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism. Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.

Table of Contents

I Scientific Computation.- 1 Parallelization Strategies for Matrix Assembly in Finite Element Methods.- 2 A Parallelisable Algorithm for Partitioning Unstructured Meshes.- 3 Plump: Parallel Library for Unstructured Mesh Problems.- 4 Parallelizing Vision Computations on CM-5: Algorithms and Experiences.- II Discrete Optimization.- 5 Scalable Parallel Algorithms for Unstructured Problems.- 6 A Parallel Grasp Implementation for the Quadratic Assignment Problem.- 7 Concurrent Data Structures for Tree Search Algorithms.- 8 A Distributed Implementation of Asynchronous Parallel Branch and Bound.- 9 Experiments with a Parallel Synchronized Branch and Bound Algorithm.- 10 Parallel Local Search and Job Shop Scheduling.- 11 A Randomized Parallel Search Strategy.- 12 A Parallel Approximation Schema for Symmetric Linear Assignment Problem.- III Tools for Automatic Parallelization.- 13 Applications of Graph Scheduling Techniques in Parallelizing Irregular Scientific Computation.- 14 Atredia: A Mapping Environment for Dynamic Tree-Structured Problems.- 15 Regularising Transformations for Integral Dependencies.- 16 Some Strategies for Load Balancing.

by "Nielsen BookData"

Details

Page Top