Parallel Algorithms for Irregularly Structured Problems: Second International Workshop, IRREGULAR '95 Lyon, France, September 4–6, 1995 Proceedings

Regular versus irregular problems and algorithms....Pages 1-25
Algorithmic skeletons for adaptive multigrid methods....Pages 27-41
Run-time techniques for parallelizing sparse matrix problems....Pages 43-57
Fast execution of irregularly structured programs with low communication frequency on the hypercube....Pages 59-73
Run-time parallelization of irregular DOACROSS loops....Pages 75-80
Instruction scheduling and global register allocation for SIMD multiprocessors....Pages 81-86
General bounds for the assignment of irregular dependency graphs....Pages 87-98
A new scheme for dynamic processor assignment for irregular problems....Pages 99-113
An efficient mean field annealing formulation for mapping unstructured domains to hypercubes....Pages 115-120
Partitioning & mapping of unstructured meshes to parallel machine topologies....Pages 121-126
Integrating software pipelining and graph scheduling for iterative scientific computations....Pages 127-141
Approximation algorithms for time constrained scheduling....Pages 143-157
On the scope of applicability of the ETF algorithm....Pages 159-164
Optimal mapping of neighbourhood-constrained systems....Pages 165-170
Parallel processing in DNA analysis....Pages 171-185
Solving computational fluid dynamics problems on unstructured grids with distributed parallel processing....Pages 187-197
Parallel decomposition of unstructured FEM-meshes....Pages 199-215
Massively parallel approximation of irregular triangular meshes with G 1 parametric surfaces....Pages 217-230
Distributed symbolic computation with DTS....Pages 231-248
A parallel processing paradigm for irregular applications....Pages 249-254
Load balancing strategies for a parallel system of particles....Pages 255-260
A reconfigurable parallel algorithm for sparse Cholesky factorization....Pages 261-274
Adapted wavelet analysis on moderate parallel distributed memory MIMD architectures....Pages 275-283
A new parallel approach to the constrained two-dimensional cutting stock problem....Pages 285-300
Using the ProSet -Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision....Pages 301-315
Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP....Pages 317-331
Better algorithms for parallel backtracking....Pages 333-347
Parallel game tree search on SIMD machines....Pages 349-361
Asynchronous parallel branch and bound and anomalies....Pages 363-377
Fast priority queues for parallel branch-and-bound....Pages 379-393
A parallel formulation for general branch-and-bound algorithms....Pages 395-409