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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'97, held in Paderborn, Germany, in June 1997.
The 18 revised full papers presented were carefully selected by the program committee for inclusion in the volume; also included are full papers by the five invited speakers. Among the topics covered are discrete algorithms, randomized methods and approximation algorithms, implementations, programming environments, systems and applications, and scheduling and load balancing.

Author(s): Dr.-Ing. Lutz Laemmer (auth.), Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José Rolim (eds.)
Series: Lecture Notes in Computer Science 1253
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997

Language: English
Pages: 287
Tags: Algorithm Analysis and Problem Complexity; Programming Techniques; Operating Systems; Numeric Computing; Computational Mathematics and Numerical Analysis; Discrete Mathematics in Computer Science

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