3. IRREGULAR 1996: Santa Barbara, California, USA

@proceedings{DBLP:conf/irregular/1996,
  editor    = {Afonso Ferreira and
               Jos{\'e} D. P. Rolim and
               Yousef Saad and
               Tao Yang},
  title     = {Parallel Algorithms for Irregularly Structured Problems, Third
               International Workshop, IRREGULAR '96, Santa Barbara, California,
               USA, August 19-21, 1996, Proceedings},
  booktitle = {IRREGULAR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1117},
  year      = {1996},
  isbn      = {3-540-61549-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk

• Torben Hagerup: Allocating Independent Tasks to Parallel Processors: An Experimental Study. 1-33

Sparse Matrix Problems

• Leonid Oliker, Rupak Biswas, Roger C. Strawn: Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2. 35-47
• William Dearholt, Steven Castillo, Gary Hennigan: Solution of Large, Sparse, Irregular Systems on a Massively Parallel Computer. 49-62
• Vaibhav Deshpande, Marcus J. Grote, Peter Messmer, William Sawyer: Parallel Implementation of a Sparse Approximate Inverse Preconditioner. 63-74
• Ümit V. Çatalyürek, Cevdet Aykanat: Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication. 75-86

Invited Talk

• Horst D. Simon, Andrew Sohn: Dynamic Spectral Partitioning (Abstract). 87

Partitioning and Domain Decomposition

• Ioannis T. Christou, Robert R. Meyer: Fast Distributed Genetic Algorithms for Partitioning Uniform Grids. 89-103
• Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan: Toward Efficient Unstructured Multigrid Preprocessing (Extended Abstract). 105-118
• Ömer Egecioglu, Ashok Srinivasan: Domain Decomposition for Particle Methods on the Sphere. 119-130
• C. T. H. Everaars, Farhad Arbab: Coordination of Distributed/Parallel Multi-grid Domain Decomposition. 131-144

Invited Talk

• Katherine A. Yelick: Systems Support for Irregular Parallel Applications (Abstract). 145

Irregular Applications I

• John A. Chandy, Steven Parkes, Prithviraj Banerjee: Distributed Object Oriented Data Structures and Algorithms for VLSI CAD. 147-158
• Yizhou Yu, Oscar H. Ibarra, Tao Yang: Parallel Progressive Radiosity with Adaptive Meshing. 159-170
• Galen C. Hunt, Randal C. Nelson: Lineal Feature Extraction by Parallel Stick Growing. 171-182
• Jesper Larsson Träff, Christos D. Zaroliagis: A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. 183-194
• Florent de Dinechin, Doran Wilde, Sanjay V. Rajopadhye, Rumen Andonov: A Regular VLSI Array for an Irregular Algorithm. 195-200

Invited Talk

• Terence R. Smith: Digital Libraries and Spatial Information Processing (Abstract). 201

Communication and Synchronization

• Stephen J. Fink, Scott B. Baden, Scott R. Kohn: Flexible Communication Mechanisms for Dynamic Structured Applications. 203-215
• Teofilo F. Gonzalez: Multi-Message Multicasting. 217-228
• Claude G. Diderich, Marc Gengler: Synchronization as a Strategy for Designing Efficient Parallel Algorithms. 229-236

Systems Support

• José E. Moreira, Kalluri Eswar, Ravi B. Konuru, Vijay K. Naik: Supporting Dynamic Data and Processor Repartitioning for Irregular Applications. 237-248
• Aart J. C. Bik, Harry A. G. Wijshoff: Simple Quantitative Experiments with a Sparse Compiler. 249-262
• George Horatiu Botorog, Herbert Kuchen: Using Algorithmic Skeletons with Dynamic Data Structures. 263-276
• Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi: An Interface Design for General Parallel Branch-and-Bound Algorithms. 277-284

Invited Talk

• Robert Schreiber: Support for Irregular Computation in High Performance Fortran (Abstract). 285

Mapping and Load Balancing

• Volker Heun, Ernst W. Mayr: Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. 287-298
• Jerrell Watts, Marc Rieffel, Stephen Taylor: Practical Dynamic Load Balancing for Irregular Problems. 299-306
• M. Lamari, Wenceslas Fernandez de la Vega: The Module Allocation Problem: An Average Case Analysis. 307-312
• Niels Reimer, Stefan U. Hänßgen, Walter F. Tichy: Dynamically Adapting the Degree of Parallelism with Reflexive Programs. 313-318
• Michelangelo Grigni, Fredrik Manne: On the Complexity of the Generalized Block Distribution. 319-326

Irregular Applications II

• Nordine Melab, Nathalie Devesa, Marie-Paule Lecouffe, Bernard Toursel: Adaptive Load Balancing of Irregular Applications - A Case Study: IDA* Applied to the 15-Puzzle Problem. 327-338
• José M. Cela, Juan C. Dürsteler, Jesús Labarta: Manufacturing Progressive Addition Lenses using Distributed Parallel Processing. 339-356