𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Parallel Algorithms for Irregular Problems: State of the Art

✍ Scribed by Jorn Behrens (auth.), Afonso Ferreira, José D. P. Rolim (eds.)


Publisher
Springer US
Year
1995
Tongue
English
Leaves
338
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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


Front Matter....Pages i-xii
Front Matter....Pages 1-1
Parallelization Strategies for Matrix Assembly in Finite Element Methods....Pages 3-24
A Parallelisable Algorithm for Partitioning Unstructured Meshes....Pages 25-46
Plump: Parallel Library for Unstructured Mesh Problems....Pages 47-71
Parallelizing Vision Computations on CM-5: Algorithms and Experiences....Pages 73-95
Front Matter....Pages 97-97
Scalable Parallel Algorithms for Unstructured Problems....Pages 99-113
A Parallel Grasp Implementation for the Quadratic Assignment Problem....Pages 115-133
Concurrent Data Structures for Tree Search Algorithms....Pages 135-155
A Distributed Implementation of Asynchronous Parallel Branch and Bound....Pages 157-176
Experiments with a Parallel Synchronized Branch and Bound Algorithm....Pages 177-193
Parallel Local Search and Job Shop Scheduling....Pages 195-212
A Randomized Parallel Search Strategy....Pages 213-227
A Parallel Approximation Schema for Symmetric Linear Assignment Problem....Pages 229-242
Front Matter....Pages 243-243
Applications of Graph Scheduling Techniques in Parallelizing Irregular Scientific Computation....Pages 245-267
Atredia: A Mapping Environment for Dynamic Tree-Structured Problems....Pages 269-296
Regularising Transformations for Integral Dependencies....Pages 297-322
Some Strategies for Load Balancing....Pages 323-338

✦ Subjects


Symbolic and Algebraic Manipulation; Processor Architectures; Theory of Computation; Software Engineering/Programming and Operating Systems


πŸ“œ SIMILAR VOLUMES


Parallel Algorithms for Irregularly Stru
✍ T. Gautier, J. L. Roch, G. Villard (auth.), Afonso Ferreira, JosΓ© Rolim (eds.) πŸ“‚ Library πŸ“… 1995 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>This book presents the proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '95, held in Lyon, France in September 1995. This workshop series addresses issues related to deriving efficient parallel solutions to irregularly structur

Parallel Algorithms for Irregularly Stru
✍ Torben Hagerup (auth.), Alfonso Ferreira, JosΓ© Rolim, Yousef Saad, Tao Yang (eds πŸ“‚ Library πŸ“… 1996 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>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.<BR>The volume presents 28 revised full papers selected from 51 submissions; also include

Parallel algorithms for regular architec
✍ Russ Miller, Quentin F. Stout πŸ“‚ Library πŸ“… 1996 πŸ› The MIT Press 🌐 English

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

Regularization Algorithms for Ill-Posed
✍ Anatoly B. Bakushinsky; Mikhail M. Kokurin; Mikhail Yu. Kokurin πŸ“‚ Library πŸ“… 2018 πŸ› De Gruyter 🌐 English

<p>This specialized and authoritative book contains an overview of modern approaches to constructing approximations to solutions of ill-posed operator equations, both linear and nonlinear. These approximation schemes form a basis for implementable numerical algorithms for the stable solution of oper

Algorithms for Continuous Optimization:
✍ Franco Giannessi (auth.), Emilio Spedicato (eds.) πŸ“‚ Library πŸ“… 1994 πŸ› Springer Netherlands 🌐 English

<p>The NATO Advanced Study Institute on "Algorithms for continuous optimizaΒ­ tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimizaΒ­ tion) from the following countries: Belgium, Brasil,