Parallel Algorithms for Irregular Problems: State of the Art

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. Language: English