Parallel Algorithms for Irregular Problems: State of the Art
26%
off

Parallel Algorithms for Irregular Problems: State of the Art

By (author)  , Edited by 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?

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.
show more

Product details

  • Hardback | 338 pages
  • 156 x 234 x 20.57mm | 1,490g
  • Dordrecht, Netherlands
  • English
  • 1995 ed.
  • XII, 338 p.
  • 0792336232
  • 9780792336235

Back cover copy

With the goal of fostering cooperation among practitioners and theoreticians of the field, the workshop and summer school on Parallel Algorithms for Irregularly Structured Problems - IRREGULAR 94 - was organized in Geneva, addressing issues related to deriving efficient solutions to irregular problems. Based on the workshop the book draws on the contributions of some outstanding scientists to present of the state of the art in irregular problems covering aspects from scientific computing, discrete optimization and automatic extraction of parallelism. It is the first book on parallel algorithms for irregular problems. The book will be of interest to advanced graduate students and researchers in the field of parallel computrer science.
show more

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.
show more