Parallel Algorithms for Irregular Problems: State of the Art
Published on 3. December 2010
Book
Paperback/Softback
XII, 338 pages
978-1-4419-4747-5 (ISBN)
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.
Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.
More details
Edition
Softcover reprint of hardcover 1st ed. 1995
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Research
Illustrations
XII, 338 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 20 mm
Weight
540 gr
ISBN-13
978-1-4419-4747-5 (9781441947475)
DOI
10.1007/978-1-4757-6130-6
Schweitzer Classification
Other editions
Additional editions
Alfonso Ferreira | José Rolim
Parallel Algorithms for Irregular Problems: State of the Art
Book
10/1995
Kluwer Academic Publishers
€160.49
Shipment within 15-20 days
Content
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.