4. IRREGULAR 1997: Paderborn, Germany

Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim (Eds.): Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings. Lecture Notes in Computer Science 1253 Springer 1997, ISBN 3-540-63138-0 BibTeX

@proceedings{DBLP:conf/irregular/1997,
  editor    = {Gianfranco Bilardi and
               Afonso Ferreira and
               Reinhard L{\"u}ling and
               Jos{\'e} D. P. Rolim},
  title     = {Solving Irregularly Structured Problems in Parallel, 4th International
               Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997,
               Proceedings},
  booktitle = {IRREGULAR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1253},
  year      = {1997},
  isbn      = {3-540-63138-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Discrete Algorithms

Lutz Laemmer: Parallel Mesh Generation. 1-12 BibTeX
Peter Sanders, Thomas Hansch: Efficient Massively Parallel Quicksort. 13-24 BibTeX
Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel: Practical Parallel List Ranking. 25-36 BibTeX
Fábio Protti, Felipe M. G. França, Jayme Luiz Szwarcfiter: On Computing All Maximal Cliques Distributedly. 37-48 BibTeX
Francisco Argüello, Nicolás Guil Mata, Juan López, Margarita Amor, Emilio L. Zapata: A Probabilistic Model for the Best-First Search B&B Algorithms. 49-60 BibTeX

Programming Environments & Implementations

Charles E. Leiserson: Programming Irregular Parallel Applications in Cilk. 61-71 BibTeX
H. Martin Bücker, Manfred Sauren: A Variant of the Biconjugate Gradient Metho Suitable for Massively Parallel Computing. 72-79 BibTeX
Laurence Tianruo Yang, Hai-Xiang Lin: Efficient Implementation of the Improved Quasi-Minimal Residual Method on Massively Distributed Memory Computers. 80-92 BibTeX
Simon A. Dobson, Don Goodeve: Programming with Shared Data Abstractions. 93-102 BibTeX
Yung-Lin Liu, Chung-Ta King: EXPLORER: Supporting Run-Time Parallelization of DO-ACROSS Loops on General Networks of Workstations. 103-110 BibTeX

Scheduling and Load Balancing

Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam: Engineering Diffusive Load Balancing Algorithms Using Experiments. 111-122 BibTeX
Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis: Comparative Study of Static Scheduling with Task Duplication for Distributed Systems. 123-133 BibTeX
Klaus Jansen, Joachim Reiter: A New Approximation Algorithm for the Register Allocation Problem. 135-146 BibTeX
Anand Srivastav, Peter Stangier: A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. 147-158 BibTeX
Thomas Decker: Virtual Data Space - A Universal Load Balancing Scheme. 159-166 BibTeX

Systems and Applications

Preeti Ranjan Panda, Hiroshi Nakamura, Nikil D. Dutt, Alexandru Nicolau: Improving cache Performance Through Tiling and Data Alignment. 167-185 BibTeX
Salvatore Orlando, Raffaele Perego: A Support for Non-uniform Parallel Loops and Its Application to a Flame Simulation Code. 186-197 BibTeX
Sorin G. Nastea, Tarek A. El-Ghazawi, Ophir Frieder: Performance Optimization of Combined Variable-Cost Computations and I/O. 198-206 BibTeX
Susann C. Allmaier, Graham Horton: Parallel Shared-Memory State-Space Exploration in Stochastic Modeling. 207-218 BibTeX
Arno Formella, Jörg Keller: Parallel Software Caches. 219-232 BibTeX
Armin Bäumker, Friedhelm Meyer auf der Heide: Communication Efficient Parallel Searching. 233-254 BibTeX
Burkhard Monien, Jürgen Schulze: Parallel Sparse Cholesky Factorization. 255-272 BibTeX
Jean Michel, François Pellegrini, Jean Roman: Unstructured Grapg Partitioning for Sparse Linear System Solving. 273-286 BibTeX