SPAA '99  

Eleventh ACM Symposium on Parallel Algorithms and Architectures

SPAA Revue

Tuesday, June 29, 1999

2:00-5:00 PM
Saint-Malo, France

Chair: Micah Adler

2:00-2:50: Invited Presentation
Multicast Snooping: A New Coherence Method Using a Multicast Address Network
Mark Hill, University of Wisconsin, Madison

2:50-3:00: Ultimate List Ranking?
Jop F. Sibeyn, Max-Planck-Institute for Computer Science

3:00-3:10: Efficient Integration of On-the-fly Data Race Detection in DSM Systems
Ayal Itzkovitch, Technion - Israel Institute of Technology
Assaf Schuster, Technion - Israel Institute of Technology
Oren Zeev-Ben-Mordehai, Technion - Israel Institute of Technology

3:10-3:50: Poster Session (with coffee break)
Poster presentations by SPAA Revue speakers, as well as:
Fast Neighbourhood Broadcast Algorithm in the Star Graph
Satoshi Fujita, Hiroshima University

A Job-Scheduling Problem within a Parallel Digital Library
Norbert Sensen, University of Paderborn

Design of an Efficient Digital Architecture for the Pre-synthesis of Direction of Micro-rotations in Flat-cordic
T. Strikanthan, Nanyang Technological University
K. Vijayan Asari, Nanyang Technological University
Bimal Gisuthan, Nanyang Technological University

3:50-4:00: Asynchronous Random Polling Dynamic Load Balancing
Peter Sanders, Max-Planck-Institute for Computer Science

4:00-4:10: Parallel Algorithms for the All-sources Generalized Shortest Paths Problem
Jeffrey D. Oldham, Stanford University
Vaughan R. Pratt, Stanford University

4:10-5:00: Invited Presentation
Eigenvalues, Eigenvectors, and Graph Partitioning
Shang-Hua Teng, University of Illinois at Urbana-Champaign

Back to SPAA '99 program

Back to SPAA home page

Thomas H. Cormen <>
Last modified: Wed Jun 2 12:55:37 1999