Table of Contents:
  • Parallel mesh generation / Lutz Laemmer, Michael Burghardt
  • Efficient massively parallel quicksort / Peter Sanders, Thomas Hansch
  • Practical parallel list ranking / Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
  • On computing all maximal cliques distributely / Fábio Protti, Felipe M.G. França, Jayme Luiz Szwarcfiter
  • A probabilistic model for best-first search B & B algorithms / F. Argüello [and others]
  • Programming irregular parallel applications in Cilk / Charles E. Leiserson
  • A variant of the biconjugate gradient method suitable for massively parallel computing / H. Martin Bücker, Manfred Sauren
  • Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers / Tianruo Yang, Hai-Xiang Lin
  • Programming with shared data abstractions / Simon Dobson, Don Goodeve
  • EXPLORER : supporting run-time parallelization of DO-ACROSS loops on general networks of workstations / Yung-Lin Lius, Chung-Ta King
  • Engineering diffusive load balancing algorithms using experiments / Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam.