Solving Irregularly Structured Problems in Parallel: 4th International Symposium, IRREGULAR'97 Paderborn, Germany, June 12–13, 1997 Proceedings

Parallel mesh generation....Pages 1-12
Efficient massively parallel quicksort....Pages 13-24
Practical parallel list ranking....Pages 25-36
On computing all maximal cliques distributedly....Pages 37-48
A probabilistic model for best-first search B&B algorithms....Pages 49-60
Programming irregular parallel applications in Cilk....Pages 61-71
A variant of the biconjugate gradient method suitable for massively parallel computing....Pages 72-79
Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers....Pages 80-92
Programming with shared data abstractions....Pages 93-102
EXPLORER: Supporting run-time parallelization of DO-ACROSS loops on general networks of workstations....Pages 103-110
Engineering diffusive load balancing algorithms using experiments....Pages 111-122
Comparative study of static scheduling with task duplication for distributed systems....Pages 123-134
A new approximation algorithm for the register allocation problem....Pages 135-146
A parallel approximation algorithm for resource constrained scheduling and bin packing....Pages 147-158
Virtual Data Space-A Universal load balancing scheme....Pages 159-166
Improving cache performance through tiling and data alignment....Pages 167-185
A support for non-uniform parallel loops and its application to a flame simulation code....Pages 186-197
Performance optimization of combined variable-cost computations and I/O....Pages 198-206
Parallel shared-memory state-space exploration in stochastic modeling....Pages 207-218
Parallel software caches....Pages 219-232
Communication efficient parallel searching....Pages 233-254
Parallel sparse Cholesky factorization....Pages 255-272
Unstructured graph partitioning for sparse linear system solving....Pages 273-286