Solving Irregularly Structured Problems in Parallel de Gianfranco Bilardi

Solving Irregularly Structured Problems in Parallel: 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1253

Gianfranco Bilardi

Afonso Ferreira

Reinhard Lüling

Jose Rolim

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 571^.63 lei
20%

Preț: 336^.71 lei
20%

Preț: 333^.46 lei
20%

Preț: 662^.76 lei
20%

Preț: 330^.23 lei
20%

Preț: 747^.79 lei
20%

Preț: 438^.67 lei
20%

Preț: 369^.12 lei
20%

Preț: 315^.76 lei
20%

Preț: 584^.40 lei
20%

Preț: 148^.66 lei
20%

Preț: 122^.89 lei
20%

Preț: 315^.18 lei
20%

Preț: 256^.26 lei
20%

Preț: 1040^.03 lei
20%

Preț: 504^.56 lei
Preț: 402^.62 lei
20%

Preț: 346^.40 lei
20%

Preț: 301^.94 lei
20%

Preț: 237^.99 lei
5%

Preț: 365^.59 lei
20%

Preț: 309^.89 lei
20%

Preț: 321^.95 lei
20%

Preț: 310^.25 lei
20%

Preț: 334^.68 lei
Preț: 373^.56 lei
20%

Preț: 172^.68 lei
20%

Preț: 1386^.07 lei
20%

Preț: 315^.76 lei
20%

Preț: 1003^.66 lei
20%

Preț: 444^.17 lei
20%

Preț: 567^.60 lei
20%

Preț: 632^.22 lei
17%

Preț: 360^.18 lei
20%

Preț: 538^.28 lei
20%

Preț: 335^.08 lei
20%

Preț: 307^.68 lei
20%

Preț: 343^.16 lei
20%

Preț: 641^.78 lei
20%

Preț: 579^.56 lei
20%

Preț: 1053^.45 lei
15%

Preț: 568^.74 lei
Preț: 389^.47 lei
20%

Preț: 333^.46 lei
20%

Preț: 607^.38 lei
20%

Preț: 326^.97 lei

Cuprins

Parallel mesh generation.- Efficient massively parallel quicksort.- Practical parallel list ranking.- On computing all maximal cliques distributedly.- A probabilistic model for best-first search B&B algorithms.- Programming irregular parallel applications in Cilk.- A variant of the biconjugate gradient method suitable for massively parallel computing.- Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers.- Programming with shared data abstractions.- EXPLORER: Supporting run-time parallelization of DO-ACROSS loops on general networks of workstations.- Engineering diffusive load balancing algorithms using experiments.- Comparative study of static scheduling with task duplication for distributed systems.- A new approximation algorithm for the register allocation problem.- A parallel approximation algorithm for resource constrained scheduling and bin packing.- Virtual Data Space-A Universal load balancing scheme.- Improving cache performance through tiling and data alignment.- A support for non-uniform parallel loops and its application to a flame simulation code.- Performance optimization of combined variable-cost computations and I/O.- Parallel shared-memory state-space exploration in stochastic modeling.- Parallel software caches.- Communication efficient parallel searching.- Parallel sparse Cholesky factorization.- Unstructured graph partitioning for sparse linear system solving.