About the IPDPS

IPDPS 2000 Program

Quick Conference Program PDF Documents

Sunday April 30

Registration Opens Late Afternoon

Monday May 1 Workshops & Tutorials

Registration Open All Day

  • Morning Break 10:00 AM – 10:30 AM

  • Lunch 12:30 – 1:30 PM

  • Afternoon Break 2:30 PM – 3:00 PM

(Breaks are for both workshop & tutorial attendees)

(* See individual workshop programs for schedule details.)

1. Heterogeneous Computing Workshop

2. Workshop on High-Level Parallel Programming Models & Supportive Environments 

3. Workshop on Biologically Inspired Solutions to Parallel Processing Problems 

4. Workshop on Parallel and Distributed Real-Time Systems

5. Workshop on Run-Time Systems for Parallel Programming

6. Reconfigurable Architectures Workshop 

7. International Workshop on Java for Parallel and Distributed Computing 

8. Workshop on Job Scheduling Strategies for Parallel Processing 

TUTORIAL 1 Morning

Multithreaded Programming for Windows NT/2000: A Practical Guide to Writing Programs for Multiprocessor PCs
John Thornley, Department of Computer Science, University of Virginia

TUTORIAL 2 Afternoon

High Performance Computing in Computational Biology
Horst D. Simon, Sylvia Spengler, Manfred Zorn
Center of Bioinformatics and Computational Genomics - NERSC

Tuesday, May 2nd

9:00 AM – 10:00 AM

Genomics and Computation: 
A new paradigm for biology research in the new millennium
Jill Mesirov, Whitehead Institute for Biomedical Research

(Break 10:00 - 10:30)

10:30 AM – 12:30

Routing and Switching

Switch Scheduling in the Multimedia Router (MMR)
D. Love and S. Yalamanchili, Georgia Institute of Technology, J. Duato, Universidad Politécnica de Valencia, Spain, M.B. Caminero and F.J. Quiles, Universidad de Castilla – La Mancha, Spain

Micro-architectures of High Performance, Multi-user System Area Network Interface Cards
Boon Seong Ang, Hewlett-Packard Laboratories, Derek Chiou, Larry Rudolph, and Arvind, Massachusetts Institute of Technology

Broadcasting in Hypercubes Under Circuit Switched Model
J.-C. Bermond and S. Pérennes, CNRS-INRIA-UNSA, France, A. Bonnecaze, Université de Toulon-Var, France, T. Kodate, and P. Sole, CNRS-INRIA, France

Improving Routing Performance in Myrinet Networks
J. Flich, M.P. Malumbres, and P. López, J. Duato, Universidad Politécnica de Valencia, Spain

Efficient Virtual Interface Architecture Support for the IBM SP Switch-Connected NT Clusters
M. Banikazemi, V. Moorthy, and D.K. Panda, The Ohio State University, L. Herger and B. Abali, IBM T.J. Watson Research Center

Adaptive Routing in RS/6000 SP-like Bidirectional Multistage Interconnection Networks
M. Banikazemi and D.K. Panda, The Ohio State University, C.B. Stunkel and B. Abali, IBM T.J. Watson Research Center

10:30 AM – 12:30

Computational Science

A General Parallel Simulated Annealing Library and Its Application in Airline Industry
Georg Kliewer and Stefan Tschöke, University of Paderborn, Germany

Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Suchendra M. Bhandarkar, Salem Machaka, Sanjay S. Shete, and Jonathan Arnold, University of Georgia

Parallel Maximum-Likelihood Inversion for Estimating Wavenumber-Ordered Spectra in Emission Spectroscopy
Hoda El-Sayed, Marc Salit, John Travis, Judith Devaney, and William George, National Institute of Standards and Technology (USA)

A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method
Fatih E. Sevilgen and Natsuhiko Futamura, Syracuse University, Srinivas Aluru, Iowa State University

Efficiency of Dynamic Load Balancing Based on Permanent Cells for Parallel Molecular Dynamics Simulation
Ryoko Hayashi and Susumu Horiguchi, Japan Advanced Institute of Science and Technology

Parallel Performance Study of Monte Carlo Photon Transport Code on Shared-, Distributed, and Distributed-Shared-Memory Architectures
Amitava Majumdar, University of California San Diego

10:30 AM – 12:30

Scheduling I

Optimal Remapping of Bulk Synchronous Computations on Multiprogrammed Distributed Systems
N.-T. Fong, C.-Z. Xu, and L.Y. Wang, Wayne State University

Gang Scheduling with Memory Considerations
Anat Batat and Dror G. Feitelson, The Hebrew University of Jerusalem

A Decision-Process Analysis of Implicit Coscheduling
R. Poovendran, P. Keleher, and J.S. Baras, University of Maryland

Improving Throughput and Utilization in Parallel Machines Through Concurrent Gang
Fabricio A.B. da Silva, Universite Pierre et Marie Curie, France, Isaac D. Scherson, University of California, Irvine

Scheduling with Advanced Reservations
Warren Smith, Argonne National Laboratory & Northwestern University,
Valerie Taylor, Northwestern University, Ian Foster, Argonne National Laboratory & University of Chicago

Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques
Yanyong Zhang and Anand Sivasubramaniam, The Pennsylvania State University, Hubertus Franke and Jose Moreira, IBM T.J. Watson Research Center

(Lunch 12:30 - 1:30)

1:30 PM – 3:30 PM

Memory Systems

A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
Takayuki Sato, Kazuhiko Ohno, and Hiroshi Nakashima, Toyohashi University of Technology, Japan

Safe Caching in a Distributed File System for Network Attached Storage
Randal C. Burns and Robert M. Rees, IBM Almaden Research Center, Darrell D.E. Long, University of California, Santa Cruz

Exploration of the Spatial Locality on Emerging Applications and the Consequences for Cache Performance
Martin Kämpe, Chalmers University of Technology, Sweden, Fredrik Dahlgren, Ericsson Mobile Communications, Sweden

Using Time Skewing to Eliminate Idle Time Due to Memory Bandwidth and Network Limitations
David Wonnacott, Haverford College

The Memory Bandwidth Bottleneck and Its Amelioration by a Compiler
Chen Ding and Ken Kennedy, Rice University

Support for Recoverable Memory in the Distributed Virtual Communication Machine
Marcel-Cătălin Roşu, IBM T.J. Watson Research Center, Karsten Schwan, Georgia Institute of Technology

1:30 PM – 3:30 PM


Multiclock Esterel: A Reactive Framework for Asynchronous Design
Basant Rajan and RK Shyamasundar, Tata Institute of Fundamental Research, India

Register Assignment for Software Pipelining with Partitioned Register Banks
Jason Hiser, University of Virginia, Steve Carr and Philip Sweany, Michigan Technological University, Steven J. Beaty, Metropolitan State College of Denver

Deterministic Replay of Distributed Java Applications
Jong-Deok Choi, Ravi Konuru, and Harini Srinivasan, IBM T.J. Watson Research Center

Evaluation of P3T+: A Performance Estimator for Distributed and Parallel Programs
T. Fahringer and A. Požgaj, University of Austria, J. Luitz, Vienna University of Technology, H. Moritsch, University of Vienna, Austria

Applying Interposition Techniques for Performance Analysis of OPENMP Parallel Applications
Marc González, Xavier Martorell, José Oliver, Albert Serra, Eduard Ayguadé, Jesús Labarta and Nacho Navarro, Universitat Politècnica de Catalunya, Spain

FIMD-MPI: A Tool for Injecting Faults into MPI Applications
Douglas M. Blough, Georgia Institute of Technology, Peng Liu, University of California, Irvine

1:30 PM – 3:30 PM


Semigroup and Prefix Computations on an Improved Generalized Mesh-Connected Computers with Multiple Buses
Yi Pan, University of Dayton, S.Q.Zheng, University of Texas at Dallas, Keqin Li, State University of New York, New Paltz, Hong Shen, Griffith University, Australia

On Parallel Sorting of an Intransitive Total-Ordered Set Using Semi-Heap
Jie Wu, Florida Atlantic University

Skiplist-Based Concurrent Priority Queue Algorithms
Itay Lotan, Stanford University, Nir Shavit, Sun Microsystems Laboratories

Sorting on the OTIS-Mesh
Andre Osterloh, TU Ilmenau, Germany

Sorting Multisets in Anonymous Rings
Paola Flocchini, Danny Krizanc, and Nicola Santoro, University of Ottawa, Canada, Evangelos Kranakis, Carleton University, Canada, Flaminia Luccio, University of Trieste, Italy

Efficient Binary Morphological Algorithms on a Massively Parallel Processor
Andreas I. Svolos, Charalampos G. Konstantopoulos, and Christos Kaklamanis, University of Patras& Computer Technology Institute, Greece

(Break 3:30 - 4:00)

4:00 PM - 6:00 PM


Top 10 Most Influential Parallel and Distributed Processing Concepts in the Last Millennium

Panelists will be asked to present their "top 10 lists" for the most influential parallel and distributed processing concepts in the last millennium. The panelists were chosen to represent a broad range of technical areas. After the panelists have given their lists, there will be an open discussion among the audience and panelists. At the end of the discussion, a ballot will be distributed for the audience to vote on the top 10 (in arbitrary order). The results of the poll will be announced the day after the panel.


  • H.J. Siegel, Purdue University


  • Mani Chandy, Caltech
  • Ken Kennedy, Rice University
  • Tom Leighton, MIT
  • Jane Liu, University of Illinois
  • Kang Shin, University of Michigan
  • Marc Snir, IBM/Yorktown
  • Larry Snyder, University of Washington
  • Thomas Sterling, JPL

Wednesday, May 3rd

9:00 AM – 10:00 AM

Compiler Architecture for High Performance Problem-Solving
Ken Kennedy, Rice University

(Break 10:00 - 10:30)

10:30 AM – 12:30 NOON

Best Papers

Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
Keqin Li, State University of New York

Speed vs. Accuracy in Simulation for I/O-Intensive Applications
Hyeonsang Eom and Jeffrey K. Hollingsworth, University of Maryland

A Parallel Implementation of A Fast Multipole Based 3-D Capacitance Extraction Program on Distributed Memory Multicomputers
Yanhong Yuan and Prith Banerjee, Northwestern University

Efficient Integration of Compiler-directed Cache Coherence and Data Prefetching
Hock-Beng Lim, University of Illinois, Pen-Chung Yew, University of Minnesota

(Lunch 12300 - 1:30)

1:30 PM – 3:30 PM

Network Routing

Optimal On Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
Maurizio A. Bonuccelli and Susanna Pelagatti, Università di Pisa, Italy

Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing
Petr Salinger and Pavel Tvrdík, Czech Technical University, Czech Republic

Distributed Models and Algorithms for Survivability in Network Routing
Fred S. Annexstein and Kenneth A. Berman, University of Cincinnati

Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles
Myung M. Bae, IBM, Bella Bose, Oregon State University

Power-Aware Distributed Routing in Wireless Networks
Ivan Stojmenovic and Xu Lin, Ottawa, Canada

Exploiting Hierarchy in Parallel Computer Networks to Optimize Collective Operation Performance
Nicholas T. Karonis, Northern Illinois University, Bronis R. de Supinkski, Lawrence Livermore National Laboratory, Ian Foster, Argonne National Laboratory & The University of Chicago, William Gropp, Ewing Lusk, and John Bresnahan, Argonne National Laboratory

1:30 PM – 3:30 PM

Data Sets and Visualization

PaDDMAS: Parallel and Distributed Data Mining Application Suite
Omer Rana, David Walker, Maozhen Li, Steven Lynden, and Mike Ward, University of Wales Cardiff, UK

VisOK : A Flexible Visualization System for Distributed Java Object Application
Dong-Woo Lee and R.S Ramakrishna, K-JIST, Republic of Korea

Bounded-Response-Time Self-Stabilizing OPS5 Production Systems
Albert M.K. Cheng, Rice University, Seiya Fujii, University of Houston

Optimizing Retrieval and Processing of Multi-Dimensional Scientific Datasets
Chialin Chang, Tahsin Kurc, and Alan Sussman, University of Maryland, Joel Saltz, Johns Hopkins Medical Institutions & University of Maryland

Using Available Remote Memory Dynamically for Parallel Data Mining Application on ATM-Connected PC Cluster
Masato Oguchi, The University of Tokyo & Aachen University of Technology, Masaru Kitsuregawa, The University of Tokyo, Japan

Image Layer Decomposition for Distributed Rendering on NOWs 
Thu D. Nguyen, Rutgers University, John Zahorjan, University of Washington, Seattle

1:30 PM – 3:30 PM

Scheduling II

CPU-Memory-based Load Sharing on Heterogeneous Distributed Systems
Xiaodong Zhang, Li Xiao, and Yanxia Qu, College of William and Mary

Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Fabrizio Petrini, Los Alamos National Laboratory, Wu-chun Feng, Purdue University

A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
Samantha Ranaweera and Dharma P. Agrawal, University of Cincinnati

S3MP: A Task Duplication Based Scalable Scheduling Algorithm for Symmetric Multiprocessors
Oh-Han Kang, Andong National University, Korea, Dharma P. Agrawal, University of Cincinnati

Job Scheduling that Minimizes Network Contention Due to Both Communication and I/O
Jens Mache, Lewis & Clark College, Virginia Lo, University of Oregon, Sharad Garg, Intel Corp.

Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
Ajoy K. Datta, University of Nevada Las Vegas, Maria Gradinariu and Sébastien Tixeuil, Université de Paris Sud, France

(Break 3:30 - 4:.00)

4:00 PM - 6:00 PM


The Ten Hottest Topics in Parallel and Distributed Computing For the Next Millennium

What will be the fundamental issues and ideas that will define parallel and distributed computing during the next Millennium? In this panel, a group of distinguished researchers will make the case for "their" candidates. You decide whether you agree, or stand up and make the case for the ideas that you think are important! The panelists include noted and opinionated experts in parallel computing, distributed computing, and applications, so the discussion is guaranteed to be lively and informative.


  • Ian Foster, Argonne National Laboratory & University of Chicago


  • David Culler, University of California Berkeley
  • Deborah Estrin, University of Southern California
  • Harvey Newman, California Institute of Technology
  • Rick Stevens, Argonne National Laboratory & University of Chicago

Thursday, May 4th

9:00 AM – 10:00 AM

Asynchronous Parallel Computing, from Theory to Practice
Michael O. Rabin, Harvard University

(Break 10:00 - 10:30)

10:30 AM – 12:30


A New Portable and Seamless Pure Java Framework for Distributed Programming Over a TCP/IP Network
Zvi Har'El and Zvi Rosberg, IBM, Haifa Research Laboratory, Israel

Reduction Optimization in Heterogeneous Cluster Environments
Pangfeng Liu, National Chung Cheng University, Da-Wei Wang, Institute of Information Science, Academia Sinica, R.O.C.

Template Based Structured Collections
Jörg Nolte, Mitsuhisa Sato, and Yutaka Ishikawa, Real World Computing Partnership, Japan

Bandwidth-efficient Collective Communication for Clustered Wide Area Systems
Thilo Kielmann and Henri E. Bal, Vrije Universiteit, The Netherlands, Sergei Gorlatch, University of Passau, Germany

Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time
Thanasis Loukopoulos and Ishfaq Ahmad, The Hong Kong University of Science and Technology, Hong Kong

Enhancing NWS for Use in an SNMP Managed Internetwork
Robert E. Busby, Jr., AT&T Network Operations, Mitchell L. Neilsen and Daniel Andresen, Kansas State University

10:30 AM – 12:30

Distributed Computing

Consensus Based on Failure Detectors with a Perpetual Accuracy Property
A. Mostefaoui and M. Raynal, IRISA, France

High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?
David Abramson, Monash University, Jon Giddy, University of Queensland, Lew Kotler, Australian Radiation Protection and Nuclear Safety Agency, Australia

Space and Time Efficient Self-Stabilizing ℓ-Exclusion in Tree Networks
Rachid Hadid, Université de Picardie Jules Verne, France

Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer
Toshiaki Miyazaki, Atsushi Takahara, Shinya Ishihara, Seiichiro Tani, Takahiro Murooka, Tomoo Fukazawa, Mitsuo Teramoto, and Kazuyoshi Matsuhiro, NTT Innovation Laboratories, Japan

Limits and Power of the Simplest Uniform and Self-Stabilizing Phase Clock Algorithm
Florent Nolot and Vincent Villain, Université de Picardie Jules Verne, France

Are Global Computing Systems Useful? – Comparison of Client-Server Global Computing Systems Ninf, NetSolve versus CORBA –
Toyotaro Suzumura and Takayuki Nakagawa, Tokyo Institute of Technology, Satoshi Matsuoka, Tokyo Institute of Technology/JST, Hidemoto Nakada and Satoshi Sekiguchi, Electrotechnical Laboratory, Japan

10:30 AM – 12:30


JavaSpMT: A Speculative Thread Pipelining Parallelization Model for Java Programs
Iffat H. Kazi and David J. Lilja, Minnesota Supercomputing Institute, University of Minnesota

On the Scheduling Algorithm of the Dynamically Trace Scheduled VLIW Architecture
Alberto Ferreira de Souza and Peter Rounce, University College London, UK

Monotonic Counters: A Powerful New Mechanism for Thread Synchronization
John Thornley, University of Virginia, K. Mani Chandy, California Institute of Technology

Thread Migration, Load Balancing, and Heterogeneity in Non-Dedicated Environments
Kritchalach Thitikamol and Peter Keleher, University of Maryland

Caching Single-Assignment Structures to Build a Robust Fine-Grain Multi-Threading System
Wen-Yen Lin and Jean-Luc Gaudiot, University of Southern California, José Nelson Amaral and Guang R. Gao, University of Delaware

A Quantitative Assessment of Thread-Level Speculation Techniques
Pedro Marcuello and Antonio Gonzalez, Universitat Politècnica de Catalunya, Spain

(Lunch 12:30 - 1:30)

1:30 PM – 3:30 PM

Wormhole Routing

An Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic
H. Sarbazi-Azad and L.M. Mackenzie, University of Glasgow, M. Ould-Khaoua, University of Strathclyde, UK

Balancing Traffic Load for Multi-Node Multicast in a Wormhole 2D Torus/Mesh
San-Yuan Wang, Yu-Chee Tseng, Ching-Sung Shiu, and Jang-Ping Sheu, National Central University, Taiwan

A Simple and Efficient Mechanism to Prevent Saturation in Wormhole Networks
E. Baydal, P. López, and J. Duato, Universidad Politécnica de Valencia, Spain

Fair and Efficient Packet Scheduling in Wormhole Networks
Salil S. Kanhere, Alpa B. Parekh, and Harish Sethu, Drexel University

Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
Seungjin Park, Michigan Tech. University, Jong-Hoon Youn and Bella Bose, Oregon State University 

1:30 PM – 3:30 PM


ACDS: Adapting Computational Data Streams for High Performance
Carsten Isert and Karsten Schwan, Georgia Institute of Technology

A Component Framework for Communication in Distributed Applications
Jeffrey M. Fischer and Milos D. Ercegovac, UCLA

Design and Evaluation of I/O Strategies for Parallel Pipelined STAP Applications
Wei-keng Liao and Alok Choudhary, Northwestern University, Donald Weiner and Pramod Varshney, Syracuse University

A Multi-tier RAID Storage System with RAID1 and RAID5
Nitin Muppalaneni and K. Gopinath, Indian Institute of Science, Bangalore, India

Performance of the IBM General Parallel File System
Alice Koniges, Terry Jones, and R. Kim Yates, Lawrence Livermore National Laboratory

1:30 PM – 3:30 PM

Shared Memory

Reducing Ownership Overhead for Load-Store Sequences in Cache-Coherent Multiprocessors
Jim Nilsson, Chalmers University of Technology, Fredrik Dahlgren, Ericsson Mobile Communications, Sweden

Dynamic Data Layouts for Cache-conscious Factorization of DFT
Neungsoo Park, Dongsoo Kang, Kiran Bondalapati, and Viktor K. Prasanna, University of Southern California

Exploring the Switch Design Space in a CC-NUMA Multiprocessor Environment
Marius Pirvu, Nan Ni, and Laxmi Bhuyan, Texas A&M University

Fast Synchronization on Scalable Cache-Coherent Multiprocessors using Hybrid Primitives
Dimitrios S. Nikolopoulos and Theodore S. Papatheodorou, University of Patras, Greece

Using Switch Directories to Speedup Cache-to-Cache Transfers in CC-NUMA Multiprocessors
Ravi Iyer, Intel Corporation, Laxmi Bhuyan, Texas A&M University, Ashwini Nanda, IBM TJ Watson Research Center

Predicting Performance on SMPs. A Case Study: The SGI Power Challenge
Nancy M. Amato, Jack Perdue, and Mark Mathis, Texas A&M University, Andrea Pietracaprina and Geppino Pucci, Università di Padova, Italy

(Break 3:30 - 4:00)

4:00 PM - 6:00 PM

Optical Computing

An Optimal Parallel Algorithm for Computing Moments on Arrays with Reconfigurable Optical Buses
Chin-Hsiung Wu and Shi-Jinn Horng, National Taiwan University of Science and Technology, Horng-Ren Tsai, The Overseas Chinese College of Commerce, R.O.C.

Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses
Anu G. Bourgeois and Jerry L. Trahan, Louisiana State University

Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
Yuanyuan Yang, State University of New York at Stony Brook, Jianchao Wang, GTE Laboratories

Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
Qian-Ping Gu and Shietung Peng, The University of Aizu, Japan

Digraph Isomorphisms and Free Space Optical Networks
D. Coudert, A. Ferreira, and S. Perennes, INRIA Sophia-Antipolis, France

4:00 PM - 6:00 PM

Numerical Algorithms

Parallel Lagrange Interpolation on the Star Graph
H. Sarbazi-Azad and L.M. Mackenzie, University of Glasgow, M. Ould-Khaoua, University of Strathclyde, U.K., S.G. Akl, Queen's University, Canada

Data Allocation Strategies for Dense Linear Algebra Kernels on Heterogeneous Two-dimensional Grids
Olivier Beaumont, Vincent Boudet, Fabrice Rastello, and Yves Robert, Ecole Normale Supérieure de Lyon, France

Multicomputer Algorithms for Wavelet Packet Image Decomposition
Manfred Feil and Andreas Uhl, University of Salzburg, Austria

On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
Wen-Yang Lin, I-Shou University, Chuen-Liang Chen, National Taiwan University, ROC

Using Postordering and Static Symbolic Factorization for Parallel Sparse LU
Michel Cosnard and Laura Grigori, LORIA-INRIA Lorraine, France

4:00 PM - 6:00 PM

Meshes and Arrays

A Constructive Solution to the Juggling Problem in Processor Array Synthesis
Alain Darte, LIP, ENS-Lyon, France, Robert Schreiber and B. Ramakrishna Rau, Hewlett-Packard Company, USA, Frédéric Vivien, ICPS, France

Repartitioning Unstructured Adaptive Meshes
Jose G. Castaños, and John E. Savage, Brown University

Study of a Multilevel Approach to Partitioning for Parallel Logic Simulation
Swaminathan Subramanian, Dhananjai M. Rao, and Philip A. Wilsey, University of Cincinnati

Friday May 5 Workshops & Tutorials

  • Morning Break 10:00 AM – 10:30 AM

  • Lunch 12 Noon – 1:00 PM

  • Afternoon Break 2:30 PM – 3:00 PM

(Breaks are for both workshop & tutorial attendees)

(* See individual workshop programs for schedule details.)

9. Workshop on Optics and Computer Science

10. Workshop on Solving Irregularly Structured Problems in Parallel

11. International Workshop on Personal Computer based Networks of Workstations

12. Workshop on Formal Methods for Parallel Programming

13. Workshop on Embedded HPC Systems and Applications

14. Workshop on Fault-Tolerant Parallel and Distributed Systems

15. Workshop on High Performance Data Mining

16. Workshop on Parallel and Distributed Computing in Image Processing, Video Processing, and Multimedia 

17. Workshop on Advances in Parallel and Distributed Computational Models 

TUTORIAL 3 Morning

The Globus Grid Programming Toolkit
Dr. Ian Foster, Argonne National Laboratory & 
University of Chicago

IPDPS 2000 Adjourns 

6 PM – 8:30 PM

Cinco de Mayo Celebration

Send questions and comments to info@ipdps.org
Designed and Maintained by Logica
Copyright © 2000. All rights reserved.