IEEE International Parallel & Distributed Processing Symposium

Technical Committee on
Parallel Processing

IPDPS 2007 Advance Program

Please visit the IPDPS website regularly for any update, since there may be schedule revisions. Authors who have corrections, contact

Paper Abstracts Preview
Full proceedings for both contributed papers and all workshops will be available at the conference. The abstracts for all papers are published in a book of abstracts with papers on a pocketed cd.
Click here to view abstracts in advance (pdf)


MONDAY, March 26, 2007

all day*

* See each individual workshop programs for schedule details

1 HCW Heterogeneity in Computing Workshop
2 WPDRTS Workshop on Parallel and Distributed Real-Time Systems
3 RAW Reconfigurable Architectures Workshop
4 HIPS-ToPMoDRS Workshop on High-Level Parallel Programming Models & Supportive Environments
5 JAVAPDC International Workshop on Java and Components for Parallelism, Distribution and Concurrency
6 NIDISC Workshop on Nature Inspired Distributed Computing
7 HiCOMB Workshop on High Performance Computational Biology
8 APDCM Advances in Parallel and Distributed Computing Models
9 CAC Communication Architecture for Clusters
10 NSFNGS NSF Next Generation Software Program
11 HPPAC High-Performance, Power-Aware Computing
12 HPGC High Performance Grid Computing
TCPP Reception
& Talk


Technical Fellow, Advanced Strategies and Policy
Microsoft Corporation

Reinventing Computing

• Read the abstract for this talk

TUESDAY, March 27, 2007
Opening Remarks 8:00 AM - 8:30 AM
Keynote I
8:30 AM - 9:30 AM

University of Utah

Large-Scale Bioimaging and Visualization

• Download PDF of presentation
• Read the abstract for this keynote

Morning Break 9:30 AM - 10:00 AM
Parallel Sessions
1, 2, 3 & 4

10:00 AM - 12:00 PM

Session 1: Peer-to-Peer Algorithms

Chair: Sushil Prasad (GSU, USA)

VoroNet: A scalable object network based on Voronoi tessellations
Olivier Beaumont (LaBRI Bordeaux, France); Anne-Marie Kermarrec (IRISA, France, France); Loris Marchal (LIP, ENS Lyon, France); Etienne Rivière (Université de Rennes 1/IRISA, France)

Almost Peer-to-Peer Clock Synchronization
Ahmed Sobeih (University of Illinois at Urbana-Champaign, USA); Michel Hack (IBM T. J. Watson Research Center, USA); Zhen Liu (IBM T.J. Watson Research Center, USA); Li Zhang (IBM T.J. Watson Research Center, USA)

Locality-Aware Consistency Maintenance for Heterogeneous P2P Systems
Zhenyu Li (Institute of Computing Technology, Chinese Academy of Sciences, P.R. China); Gao-Gang Xie (Insitute of Computing Technology, Chinese Academy of Sciences, P.R. China); Zhongcheng Li (Institute of Computing Technology, Chinese Academy of Sciences, P.R. China)

Benefits of Targeting in Trusted Gossiping for Peer-to-Peer Information Sharing
Arindam Mitra (University of Manitoba, Canada); Muthucumaru Maheswaran (McGill University, Canada)

Session 2: Science, Finance and Combinatorial Applications

Chair: Neil Pundit (Sandia National Laboratories, USA)

Building the Tree of Life on Tera-scale Systems
Xizhou Feng (Virginia Tech, USA); Kirk Cameron (Virginia Tech, USA); Brian Smith (IBM Rochester, USA); Carlos Sosa (IBM, USA)

Inverse Space-Filling Curve Partitioning of a Global Ocean Model
John Dennis (National Center for Atmospheric Research, USA)

A Parallel Workflow for Real-time Correlation and Clustering of High-Frequency Stock Market Data
Alan Wagner (University of British Columbia, Canada); Camilo Rostoker (University of British Columbia, Canada); Holger Hoos (University of British Columbia, Canada)

A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Nordine Melab (Univerisité de Lille1, France); Mohand Mezmaz (Univerisité de Lille1, France); El-Ghazali Talbi (CNRS/LIFL University of Lille1, France)

Session 3: Cluster and Server Architectures

Chair: Craig Stunkel (IBM T.J. Watson Research Center, USA)

MultiEdge: An Edge-based Communication Subsystem for Scalable Commodity Servers
Sven Karlsson (FORTH-ICS, Crete, Greece); Stavros Passas (FORTH-ICS & University of Crete, Greece); George Kotsis (ICS-FORTH, Greece, Greece); Angelos Bilas (FORTH-ICS & University of Crete, Greece)

Efficient Block Device Sharing over Myrinet with Memory Bypass
Evangelos Koukis (National Technical University of Athens, Greece); Nectarios Koziris (National Technical University of Athens, Greece)

Achieving Reliable Parallel Performance in a VoD Storage Server Using Randomization and Replication
Yung Choe (Purdue University, USA); Vijay Pai (Purdue University, USA)

A Cost-Effective, High Bandwidth Server I/O network Architecture for Cluster Systems
Hsing-bung Chen (Los Alamos National Lab, USA)

Session 4: Software Support for Large Scale Scientific Computing

Chair: Bronis de Supinski (Lawrence Livermore National Laboratory, USA)

Babel Remote Method Invocation
Gary Kumfert (Lawrence Livermore National Laboratory, USA); James Leek (Lawrence Livermore National Laboratory, USA); Thomas Epperly (Lawrence Livermore National Laboratory, USA)

Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
Pavan Balaji (Argonne National Laboratory, USA); Darius Buntinas (Argonne National Laboratory, USA); Satish Balay (Argonne National Laboratory, USA); Barry Smith (Argonne National Laboratory, USA); Rajeev Thakur (Argonne National Laboratory, USA); William Gropp (Argonne National Laboratory, USA)

CCA-LISI: On Designing A CCA Parallel Sparse Linear Solver Interface
Fang Liu (Indiana University, USA); Randall Bramley (Indiana University, USA)

Optimizing Distributed Application Performance Using Dynamic Grid Topology-Aware Load Balancing
Gregory Koenig (University of Illinois at Urbana-Champaign, USA); Laxmikant Kale (University of Illinois at Urbana-Champaign, USA)

Parallel Sessions
5, 6, 7 and 8

1:30 PM - 3:30 PM

Session 5: Scheduling Algorithms

Chair: Frédéric Vivien (INRIA, France)

On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids
Claris Castillo (North Carolina State University, USA); George Rouskas (North Carolina State University, USA); Khaled Harfoush (North Carolina State University, USA)

Reconfigurable Resource Scheduling
Greg Plaxton (University of Texas at Austin, USA); Yu Sun (University of Texas at Austin, USA); Mitul Tiwari (University of Texas at Austin, USA); Harrick Vin (University of Texas at Austin, USA)

A Strategyproof Mechanism for Scheduling Divisible Loads in Linear Networks
Thomas Carroll (Wayne State University, USA); Daniel Grosu (Wayne State University, USA)

Scheduling in the Z-Polyhedral Model
Gautam Gupta (Colorado State University, USA); DaeGon Kim (Colorado State University, USA); Sanjay Rajopadhye (Colorado State University, USA)

Session 6: Search, Text and Web Applications

Chair: Muthucumaru Maheswaran (McGill University, Canada)

A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
Xiaoyu Yang (University of Cincinnati, USA); Yiming Hu (University of Cincinnati, USA)

Optimized Inverted List Assignment in Distributed Search Engine Architectures
Jiangong Zhang (Polytechnic University, USA); Torsten Suel (Polytechnic University, USA)

Scalable Visual Analytics of Massive Textual Datasets
Manojkumar Krishnan (Pacific Northwest National Laboratory, USA); Jarek Nieplocha (Pacific Northwest National Laboratory, USA); Shawn Bohn (Pacific Northwest National Laboratory, USA); Wendy Cowley (Pacific Northwest National Laboratory, USA); Vernon Crow (Pacific Northwest National Laboratory, USA)

Spam-Resilient Web Rankings via Influence Throttling
James Caverlee (Georgia Institute of Technology, USA); Steve Webb (Georgia Institute of Technology, USA); Ling Liu (Georgia Tech, USA)

Session 7: Processor Architecture

Chair: Frederica Darema (National Science Foundation, USA)

Conserving Memory Bandwidth in Chip Multiprocessors with Runahead Execution 
Martin Karlsson (Uppsala University, Sweden);
Erik Hagersten (Uppsala University, Sweden)

Simulating Red Storm: Challenges and Successes in Building a System Simulation 
Keith Underwood (Sandia National Labs, USA);
Michael Levenhagen (Sandia National Labs, USA); Arun Rodrigues (Sandia National Labs, USA)

Architectural Support for Network Applications on Simultaneous MultiThreading Processors
Kyueun Yi (University of California, Irvine, USA); Jean-Luc Gaudiot (University of California, USA)

Microarchitectural Support for Speculative Register Renaming
Jesus Alastruey (University of Zaragoza, Spain); Teresa Monreal (University of Zaragoza, Spain); Victor Viñals (University of Zaragoza, Spain); Mateo Valero (Technical University of Catalonia, Spain)

Session 8: Performance Analysis and Optimization

Chair: Erik Dirkx (Vrije Universiteit Brussels, Belgium)

Automatic Trace-Based Performance Analysis of Metacomputing Applications
Daniel Becker (Research Center Juelich, Germany); Felix Wolf (Research center Jülich, Germany); Wolfgang Frings (Research Center Jülich, Germany); Markus Geimer (Research Center Jülich, Germany); Brian J.N. Wylie (Research Center Jülich, Germany); Bernd Mohr (Forschungszentrum Juelich, Germany)

An Implementation and Evaluation of Client-side File Caching for MPI-IO
Wei-keng Liao (Northwestern University, USA); Avery Ching (Northwestern University, USA); Kenin Coloma (Northwestern University, USA); Alok Choudhary (Northwestern University, USA); Lee Ward (Sandia National Laboratories, USA)

A Utility-based Approach to Cost-Aware Caching in Heterogeneous Storage Systems
Liton Chakraborty (University of Waterloo, Canada); Ajit Singh (University of Waterloo, Canada)

Integrated Risk Analysis for a Commercial Computing Service
Chee Shin Yeo (The University of Melbourne, Australia); Rajkumar Buyya (The University of Melbourne, Australia)

Parallel Sessions
9, 10, 11 and 12

4:00 PM - 6:00 PM

Session 9: Complexity of Algorithms

Chair: Subhash Saini (NASA Ames, USA)

Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
Deng Pan (State University of New York at Stony Brook, USA); Yuanyuan Yang (State University of New York at Stony Brook, USA)

Network-Oblivious Algorithms
Gianfranco Bilardi (University of Padova, Italy); Andrea Pietracaprina (University of Padova, Italy); Geppino Pucci (University of Padova, Italy); Francesco Silvestri (University of Padova, Italy)

Minimum number of wavelengths equals load in a DAG without internal cycle
Jean-Claude Bermond (CNRS, France); Michel Cosnard (INRIA, France)

A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
Robert Hall (University of Massachusetts, USA); Arnold Rosenberg (University of Massachusetts, USA); Arun Venkataramani (UMass Amherst, USA)

Session 10: Power and Energy Aware Computing

Chair: Sandeep Gupta (Arizona State University, USA)

Power-Aware Speedup
Rong Ge (Virginia Tech, USA); Kirk Cameron (Virginia Tech, USA)

A Near-optimal Solution for the Heterogeneous Multi-processor Single-level Voltage Setup Problem
Tai-Yi Huang (National Tsing Hua University, Taiwan); Yu-Che Tsai (National Tsing Hua University, Taiwan); Edward Chu (National Tsing Hua University, Taiwan)

Optimal Energy Balanced Data Gathering in Wireless Sensor Networks
Haibo Zhang (University of Adelaide, Australia); Hong Shen (Univ. of Adelaide, Australia); Yasuo Tan (JAIST, Japan)

Verifiable Credit Based Transfers in Wireless Ad Hoc Networks
Bogdan Carbunar (Motorola Labs, USA); Brett Lindsley (Motorola Labs, USA); Michael Pearce (Motorola Labs, USA); Venu Vasudevan (Motorola, Inc., USA)

Session 11: Performance Modeling and Evaluation

Chair: Umit Catalyurek (The Ohio State University, USA)

Towards A Better Understanding of Workload Dynamics on Data-Intensive Clusters and Grids
Hui Li (Leiden University, The Netherlands); Lex Wolters (Leiden University, The Netherlands)

Efficient Statistical Performance Modeling for Autonomic, Service-oriented Systems
Rui Zhang (University of Oxford, United Kingdom); Alan Bivens (IBM, USA); Iead Rezek (University of Oxford, United Kingdom)

Multicore Surprises: Lesson Learned from Optimizing Sweep3D on the Cell Broadband Engine
Fabrizio Petrini (PNL, USA); Gordon Fossum (IBM, USA); Ana Varbanescu (Delft University, The Netherlands); Michael Perrone (IBM, USA); Michael D. Kistler (IBM Research, USA); Juan Fernandez Peinador (University of Murcia, Spain)

Challenges in Mapping Graph Exploration Algorithms on Advanced Multi-core Processors
Fabrizio Petrini (PNL, USA); Daniele Scarpazza (Pacific Nortwhest National Laboratory, USA); Oreste Villa (PNNL, USA); Juan Fernandez Peinador (University of Murcia, Spain)

Session 12: Middleware and Tools

Chair: Gagan Agrawal (The Ohio State University, USA)

Stack Trace Analysis for Large Scale Debugging
Dorian Arnold (University of Wisconsin, USA); Dong Ahn (Lawrence Livermore National Laboratory, USA); Bronis de Supinski (Lawrence Livermore National Laboratory, USA); Gregory Lee (Lawrence Livermore National Laboratory, USA); Barton Miller (University of Wisconsin, USA); Martin Schulz (Lawrence Livermore National Laboratory, USA)

Single IP Address Cluster for Internet Servers
Hiroya Matsuba (University of Tokyo, Japan); Yutaka Ishikawa (University of Tokyo, Japan)

RF2ID: A Reliable Middleware Framework for RFID Deployment
Nova Ahmed (Georgia Institute of Technology, USA); Rajnish Kumar (Georgia Institute of Technology, USA); Umakishore Ramachandran (Georgia Institute of Technology, USA); Robert French (Georgia Institute of Technology, USA)

A WSRF-Compliant Debugger for Grid Applications
Donny Kurniawan (Monash University, Australia); David Abramson (Monash University, Australia)

Symposium Tutorial
7:00 PM - 10:00 PM

Symposium Tutorial
High-performance Computing Methods for Computational Genomics
Presenters: Srinivas Aluru, David A. Bader, and Ananth Kalyanaraman

• Read the abstract for this tutorial

WEDNESDAY, March 28, 2007
Keynote II
8:30 AM - 9:30 AM

Michael J. Flynn
Stanford University

Avoiding the Memory Bottleneck through Structured Arrays

• Read the abstract for this keynote

Morning Break 9:30 AM - 10:00 AM

Best Papers Session
10:00 AM - 12:00 PM

Best Papers

Chair: Dhabaleswar Panda (The Ohio State University, USA)

Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations
Umit Catalyurek (The Ohio State University, USA); Erik Boman (Sandia National Laboratories, USA); Karen Devine (Sandia National Laboratories, USA); Doruk Bozdag (The Ohio State University, USA); Robert Heaphy (Sandia National Laboratories, USA); Lee Ann Riesen (Sandia National Laboratories, USA)

Scientific Application Performance on Candidate PetaScale Platforms
Leonid Oliker (LBNL, USA); Andrew Canning (Lawrence Berkeley National Laboratory, USA); Jonathan Carter (Lawrence Berkeley National Laboratory, USA); Costin Iancu (Lawrence Berkeley National Laboratory, USA); Michael Lijewski (Lawrence Berkeley National Laboratory, USA); Shoaib Kamil (LBNL, USA); John Shalf (LBNL, USA); Hongzhang Shan (LBL, USA); Erich Strohmaier (lbl, USA); Stephane Ethier (PPPL, USA); Tom Goodale (CCT, USA)

Speculative flow control for high-radix datacenter interconnect routers
Cyriel Minkenberg (IBM Zurich Research Laboratory, Switzerland); Mitchell Gusat (IBM Zurich research laboratory, Switzerland)

Scalable Compression and Replay of Communication Traces in Massively Parallel Environments
Michael Noeth (NCSU, USA); Frank Mueller (NCSU, USA); Martin Schulz (Lawrence Livermore National Laboratory, USA); Bronis de Supinski (Lawrence Livermore National Laboratory, USA)

Parallel Sessions
13, 14, 15 and 16
1:30 PM - 3:30 PM

Session 13: Wireless, Adhoc and Sensor Algorithms

Chair: Jie Wu (Florida Atlantic University and National Science Foundation, USA)

Distributed, Reliable Restoration Techniques using Wireless Sensor Devices
Vana Kalogeraki (University of California, Riverside, USA); Yannis Drougas (University of California, Riverside, USA)

Topology-Transparent Duty Cycling for Wireless Sensor Networks
Yu Chen (ARES / INRIA, INSA de Lyon, France); Eric Fleury (Insa de Lyon / INRIA, France); Violet Syrotiuk (Arizona State University, USA)

Average-Case Performance Evaluation of Online Algorithms for Routing and Wavelength Assignment in WDM Optical Networks
Keqin Li (State University of New York at New Paltz, USA)

Energy-Aware Self-Stabilization in Mobile Ad Hoc Networks : A Multicasting Case Study
Sandeep Gupta (Arizona State University, USA); Tridib Mukherjee (Arizona State University, USA); Ganesh Sridharan (Arizona State University, USA)

Session 14: Applications on Emerging Architectures

Chair: Fabrizio Petrini (PNL, USA)

On the Design and Analysis of Irregular Algorithms on the Cell Processor: A case study on list ranking
David Bader (Georgia Institute of Technology, USA); Virat Agarwal (Georgia Institute of Technology, USA); Kamesh Madduri (Georgia Institute of Technology, USA)

RAxML-Cell: Parallel Phylogenetic Tree Inference on the Cell Broadband Engine
Filip Blagojevic (Virginia Tech, USA); Alexandros Stamatakis (Swiss Federal Institute of Technology, Switzerland); Christos Antonopoulos (College of William & Mary, USA); Dimitrios Nikolopoulos (Virginia Tech, USA)

Hardware/Software Co-Design for Matrix Computations on Reconfigurable Computing Systems
Ling Zhuo (University of Southern California, USA); Viktor Prasanna (University of Southern California, USA)

Masked Queries for Search Accuracy in Peer-to-Peer File-Sharing Systems
Wai Gen Yee (Illinois Institute of Technology, USA); Linh Nguyen (Illinois Institute of Technology, USA); Ophir Frieder (Illinois Institute of Technology, USA)

Session 15: Interconnection Networks

Chair: Ron Brightwell (Sandia National Laboratories, USA)

Mixed-radix Twisted Torus Interconnection Networks
José Cámara (University of Burgos, Spain); Miquel Moreto (Universitat Politècnica de Catalunya, Spain); Enrique Vallejo (University of Cantabria, Spain); Ramon Bievide (Univeersity of Cantabria, Spain); Jose Miguel-Alonso (The University of the Basque Country, Spain); Carmen Martinez (University of Cantabria, Spain); Javier Navaridas (The University of the Basque Country, Spain)

Performance, Cost, and Energy Evaluation of Fat H-Tree: A Cost-Efficient Tree-Based On-Chip Network
Hiroki Matsutani (Keio University, Japan); Michihiro Koibuchi (National Institute of Informatics, Japan); Hideharu Amano (Keio University, Japan)

Table-lookup based Crossbar Arbitration for Minimal-Routed, 2D Mesh and Torus Networks
DaeHo Seo (Purdue University, USA); Mithuna Thottethodi (Purdue University, USA)

Power-Aware Bandwidth-Reconfigurable Optical Interconnects for High-Performance Computing (HPC) Systems
Avinash Kodi (University of Arizona, USA); Ahmed Louri (University of Arizona, USA)

Session 16: Performance Prediction and Distributed Systems

Chair: Yuanyuan Yang (State University of New York at Stony Brook, USA)

A Performance Prediction Framework for Grid-Based Data Mining Applications
Leo Glimcher (The Ohio State Universitry, USA); Gagan Agrawal (The Ohio State University, USA)

Prediction Services for Distributed Computing
Warren Smith (University of Texas, USA)

Adaptive Predictor Integration for System
Jian Zhang (University of Florida, USA); Renato Figueiredo (University of FLorida, USA)

Machine Bank: Own Your Virtual Personal Computer
Shuo Tang (Tsinghua University, P.R. China); Yu Chen (Microsoft Research Asia, P.R. China); Zheng Zhang (Microsoft Research Asia, P.R. China)

4:00 PM -
6:00 PM


Is the Multi-Core Roadmap going to Live Up to its Promises?

Per Stenstrom (Chalmers University of Technology, Sweden)

Michel Dubois, USC
Tim Mattson, Intel
Kunle Olukotun, Stanford
Dean Tullsen, UCSD
• Robert Cypher, Sun Microsystems
Greg Pfister, IBM Systems & Technology Group

• Read the abstract for this panel

and Talk

7:30 PM -
9:30 PM

Mark Seager
Lawrence Livermore National Labs

Why Peta-Scale is Different: An Ecosystem Approach to Predictive Scientific and Engineering Simulation

• Read the abstract for this talk

THURSDAY, March 29, 2007

Keynote III
8:30 AM - 9:30 AM

Umesh Vazirani
University of California Berkeley

Quantum Physics and the Nature of Computing

• Read the abstract for this keynote

Morning Break 9:30 AM- 10:00 AM

Parallel Sessions
17, 18, 19 and 20
10:00 AM - 12:00 PM

Session 17: Network Algorithms

Chair: Vladimir Getov (University of Westminster, United Kingdom)

A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Samee Khan (University of Texas, USA); Ishfaq Ahmad (University of Texas at Arlington, USA)

Online Aggregation over Trees
Mitul Tiwari (University of Texas at Austin, USA); Greg Plaxton (UniversityT. Austin, ? ); Praveen Yalagandula (HP Labs, USA)

Optimizing Multiple Distributed Stream Queries Using Hierarchical Network Partitions
Sangeetha Seshadri (Georgia Institute of Technology, USA); Vibhore Kumar (Georgia Institute of Technology, USA); Brian Cooper (Georgia Institute of Technology, USA); Ling Liu (Georgia Tech, USA)

A Scalable Cluster Algorithm for Internet Resources
Chuang Liu (Microsoft, USA); Ian Foster (University of Chicago, USA)

Session 18: Peer-to-Peer Systems and Applications I

Chair: Alan Sussman (University of Maryland, USA)

Making Peer-to-Peer Anonymous Routing Resilient to Failures
Yingwu Zhu (Seattle University, USA); Yiming Hu (University of Cincinnati, USA)

Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols
Li Lu (Graduate School of Chinese Academy of Sciences, P.R. China); Jinsong Han (Hong Kong University of Science and Technology, Hong Kong); Lei Hu (State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences), P.R. China); Jinpeng Huai (Beihang University, P.R. China); Yunhao Liu (Hong Kong University of Science and Technology, Hong Kong); Lionel Ni (Hong Kong University of Science & Technology, Hong Kong)

Gossip-based Reputation Aggregation for Unstructured Peer-to-Peer Networks
Runfang Zhou (USC, USA); Kai Hwang (Univ. of Southern California, USA)

Replication Strategy in Unstructured Peer-to-Peer Systems
Guofu Feng (Nanjing Audit University, P.R. China); Yuquan Jiang (Nanjing Audit University, P.R. China); Guihai Chen (Nanjing University, P.R. China); Qing Gu (Nanjing University, P.R. China); Sanglu Lu (Nanjing University, P.R. China); Daoxu Chen (Nanjing University, P.R. China)

Session 19: Networks and Storage Systems

Chair: Scott Pakin (Los Alamos National Laboratory, USA)

Packet Reordering in Network Processors
Govind Sreekarshenoy (Indian Institute of Science, India); Govindarajan Ramaswamy (Indian Institute of Science, India); Joy Kuri (Indian Institute of Science, India)

Deadline-based QoS for High-performance Networks
Alejandro Martínez-Vicente (University of Castilla-La Mancha, Spain); Francisco Alfaro (University of Castilla-La Mancha, Spain); José-Luis Sanchez (University Castilla La Mancha, Spain); Jose Duato (Universidad Politecnica de Valencia, Spain)

Parallel I/O Performance Characterization of Columbia and NEC SX-8 Superclusters
Subhash Saini (NASA Ames, USA); Dale Talcott (NASA Ames Research Center, USA); Rajeev Thakur (Argonne National Laboratory, USA); Panagiotis Adamidis (University of Stuttgart, Germany); Rolf Rabenseifner (University of Stuttgart, Germany); Robert Ciotti (NASA Ames Research Center, USA)

Design Alternatives for a High-Performance Self-Securing Ethernet Network Interface
Derek Schuff (Purdue University, USA); Vijay Pai (Purdue University, USA)

Session 20: Compiler Optimization and Software Environment

Chair: Martin Schulz (Lawrence Livermore National Laboratory, USA)

Towards Optimal Multi-level Tiling for Stencil Computations
Lakshminarayanan Renganarayana (Colorado State University, USA); Manjukumar Harthikote-Matha (Colorado State University, USA); Rinku Dewri (Colorado State University, USA); Sanjay Rajopadhye (Colorado State University, USA)

An Optimizing Compiler for Parallel Chemistry Simulations
Jun Cao (Purdue University, USA); Ayush Goyal (Purdue University, India); Sam Midkiff (Purdue University, USA); James Caruthers (Purdue University, USA)

A Scalable Approach for the Secure and Authorized Tracking of the Availability of Entities in Distributed Systems
Shrideep Pallickara (Indiana University, USA); Jaliya Ekanayake (Indiana University, USA); Geoffrey Fox (Indiana University, USA)

Architectural Considerations for Efficient Software Execution on Parallel Microprocessors
Srinivas Vadlamani (University of California, Irvine, USA); Stephen Jenks (University of California, Irvine, USA)

Commercial Showcase
Times to be announced

Commercial Showcase
A special one-day program for Commercial Participants to showcase and present their technologies

Return for details

Parallel Sessions
21, 22, 23 and 24

1:30 PM - 3:30 PM

Session 21: Distributed Algorithms

Chair: Angelos Bilas (FORTH-ICS & University of Crete, Greece)

File Creation Strategies in a Distributed Metadata File System
Ananth Devulapalli (Ohio Supercomputer Center, USA); Pete Wyckoff (Ohio Supercomputer Center, USA)

Fast Failure Detection in a Process Group
Xinjie Li (Wayne State University, USA); Monica Brockmeyer (Wayne State University, USA)

Aggregate Threshold Queries in Sensor Networks
Izchak Sharfman (Technion, Israel); Assaf Schuster (Technion - Israel Institute of Technology, Israel); Daniel Keren (Haifa University, Israel)

A Model for Large Scale Self-Stabilization
Thomas Herault (Universite Paris Sud (LRI), France); Pierre Lemarinier (Universite Paris Sud (LRI), France); Olivier Peres (Univ Paris Sud; LRI UMR8623; INRIA; Orsay F-91405, France); Laurence Pilard (Univ Paris Sud; LRI UMR8623; INRIA; Orsay F-91405, France); Joffroy Beauquier (Univ Paris Sud; LRI UMR8623; INRIA; Orsay F-91405, France)

Session 22: Peer-to-Peer Systems and Applications II

Chair: Kai Hwang (Univ. of Southern California, USA)

Performance scalability of the JXTA P2P framework
Mathieu Jan (LRI (INRIA Futurs), France); Gabriel Antoniu (INRIA, France); Loïc Cudennec (IRISA (inria), France); Mike Duigou (Sun Microsystems, USA)

Popularity Adaptive Search in Hybrid P2P Systems
Xiaoqiu Shi (Wenzhou University, P.R. China); Jinsong Han (Hong Kong University of Science and Technology, Hong Kong); Yunhao Liu (Hong Kong University of Science and Technology, Hong Kong); Lionel Ni (Hong Kong University of Science & Technology, Hong Kong)

CoQUOS: Lightweight Support for Continuous Queries in Unstructured Overlays
Lakshmish Ramaswamy (University of Georgia, USA); Jianxia Chen (University of Georgia, USA); Piyush Parate (University of Georgia, USA)

RASC: Dynamic Rate Allocation for Distributed Stream Processing Applications
Yannis Drougas (University of California, Riverside, USA); Vana Kalogeraki (University of California, Riverside, USA)

Session 23: Job Scheduling

Chair: Frederic Desprez (INRIA, France)

Provably Efficient Adaptive Scheduling Through Equalized Allotments
Yuxiong He (Nanyang Technological University, Singapore); Wen Jing Hsu (Nanyang Technological University, Singapore); Charles Leiserson (MIT, USA)

Analysis of Scheduling Algorithms with Reservations
Gregory Mounié (Institut National Politechnique de Grenoble, France); Lionel Eyraud-Dubois (ID-IMAG, France); Denis Trystram (Univ. of Grenoble, France)

An Adaptive Rescheduling Strategy for Grid Workflow Applications
Weisong Shi (Wayne State University, USA); Zhifeng Yu (Wayne State University, USA)

Predictive Resource Scheduling in Computational Grids
Clovis Chapman (University College London, United Kingdom); Mirco Musolesi (University College London, United Kingdom); Wolfgang Emmerich (University College London, United Kingdom); Cecilia Mascolo (University College London, United Kingdom)

Session 24: Fault Tolerance and Checkpointing

Chair: Daniel Katz (Louisiana State University, USA)

A Job Pause Service under LAM/MPI+BLCR for Transparent Fault Tolerance
Chao Wang (NCSU, USA); Frank Mueller (NCSU, USA); Christian Engelmann (Oak Ridge National Laboratory, USA); Stephen Scott (Oak Ridge National Laboratory, USA)

An optimistic checkpointing and selective message logging approach for consistent global checkpoint collection in distributed systems
Qiangfeng Jiang (University of Kentucky, USA); D. Manivannan (University of Kentucky, USA)

DejaVu: Transparent User-Level Checkpointing, Migration and Recovery for Distributed Systems
Joseph Ruscio (Virginia Tech, USA); Michael Heffner (EverGrid, Inc., USA); Srinidhi Varadarajan (Virginia Tech, USA)

A Fault Tolerance Protocol with Fast Fault Recovery
Sayantan Chakravorty (University of Illinois at Urbana-Champaign, USA); Laxmikant Kale (University of Illinois at Urbana-Champaign, USA)

Parallel Sessions
25, 26 and 27

4:00 PM - 5:30 PM

Session 25: Load Balancing Algorithms

Chair: Anne Benoit (ENS Lyon, France)

Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs
Dong Lin (Tsinghua University, P.R. China); Yue Zhang (Tsinghua University, P.R. China); Chengchen Hu (Tsinghua University, Beijing, P. R. China, P.R. China); Bin Liu (Tsinghua University, P.R. China); Xin Zhang (Carnegie Mellon University, USA); Derek Pao (City University of Hong Kong, Hong Kong)

Dynamic Multi-User Load Balancing in Distributed Systems
Satish Penmatsa (University of Texas at San Antonio, USA); Anthony Chronopoulos (The University of Texas at San Antonio, USA)

Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
Min Cai (University of Southern California, USA); Kai Hwang (Univ. of Southern California, USA)

Session 26: Distributed and Mobile Applications

Chair: Yanyong Zhang (Rutgers University, USA)

A Performance Analysis of Indirect Routing
Josh Opos (University of California, San Diego, USA); Sriram Ramabhadran (University of California, San Diego, USA); Andrew Terry (University of California, San Diego, USA); Joseph Pasquale (University of California, San Diego, USA); Alex Snoeren (UC San Diego, USA); Amin Vahdat (UC, San Diego, USA)

Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment
Jay Smith (IBM, USA); Luis Briceño (Colorado State University, USA); Tony Maciejewski (Colorado State Univ., USA); H. j. Siegel (Colorado State University, USA); David Janovy (Colorado State University, USA); Timothy Renner (Colorado State University, USA); Vladimir Shestak (Colorado State University, USA); Joshua Ladd (Colorado State University, USA); Andrew Sutton (Colorado State University, USA); Sudhar Govindasamy (Colorado State University, USA); Amin Alqudah (Colorado State University, USA); Rinku Dewri (Colorado State University, USA); Puneet Prakash (Colorado State University, USA)

Implementing Replica Placements: Feasibility and Cost Minimization
Thanasis Loukopoulos (Hong Kong University of Science and Technology, Hong Kong); Nikos Tziritas (University of Thessaly, Greece); Petros Lampsas (Computer Engineering Dept., University of Thessaly, Greece); Spyros Lalis (University of Thessaly, Greece)

Session 27: Algorithms for Parallel Execution

Chair: David Bader (Georgia Institute of Technology, USA)

Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
Ming Wu (Institute of Computing Technology, Chinese Academy of Sciences, P.R. China); Xiao-Feng Li (Middleware Products Division, Software and Solutions Group, Intel Corp, P.R. China)

Taking Advantages of Collective Operation Semantics for Loosely Coupled Simulations
Joe Shang-Chieh Wu (University of Maryland, USA); Alan Sussman (University of Maryland, USA)

Accelerating Distributed Computing Applications Using a Network Offloading Framework
Yaron Weinsberg (The Hebrew University Of Jerusalem, Israel); Danny Dolev (The Hebrew University of Jerusalem, Israel); Pete Wyckoff (Ohio Supercomputer Center, USA); Tal Anker (Marvell, Israel)

Commercial Track
4:00 PM –
5:30 PM

Commercial Presentations

New Developments in Intel Chipset Architecture
Presentered by Sivakumar Radhakrishnan & Sundaram Chinthamani, Intel

The Impact of MultiCore Processors on HPC Cluster Design
Presented by Marc Hamilton, Sun Microsystems

FRIDAY, March 30, 2007

all day*

* See each individual workshop programs for schedule details

13 PDSEC Workshop on Parallel and Distributed Scientific and Engineering Computing
14 PMEO-PDS Performance Modelling, Evaluation, and Optimisation of Parallel and Distributed Systems
15 DPDNS Dependable Parallel, Distributed and Network-Centric Systems
16 SSN International Workshop on Security in Systems and Networks
17 SMTPS Workshop on System Management Techniques, Processes, and Services
18 POHLL Performance Optimization for High-Level Languages and Libraries
19 HOTP2P Third International Workshop on Hot Topics in Peer-to-Peer Systems
20 PCGRID Workshop on Large-Scale, Volatile Desktop Grids
21 MTAAP Workshop on Multi-Threaded Architectures and Applications

Monday, March 26, 2007, Evening

Burton Smith
Technical Fellow, Advanced Strategies and Policy
Microsoft Corporation

Reinventing Computing

The many-core inflection point presents a new challenge for our industry, namely general-purpose parallel computing. Unless this challenge is met, the continued growth and importance of computing itself and of the businesses engaged in it are at risk. We must make parallel programming easier and more generally applicable than it is now, and build hardware and software that will execute arbitrary parallel programs on whatever scale of system the user has. The changes needed to accomplish this are significant and affect computer architecture, the entire software development tool chain, and the army of application developers that will rely on those tools to develop parallel applications. This talk will point out a few of the hard problems that face us and some prospects for addressing them.

Dr. Burton J. Smith, Technical Fellow for Microsoft Corporation, works with various groups within the company to help expand efforts in the areas of parallel and high performance computing. He reports directly to Craig Mundie, chief technical officer and senior vice president for Advanced Strategies and Policy.

Burton is recognized as an international leader in high performance computer architecture and programming languages for parallel computers. Before joining Microsoft, he served at Cray Inc., formerly Tera Computer Company, as chief scientist and a member of the board of directors from its inception in 1988 to December 2005, and was its chairman from 1988 to 1999. Prior to founding Tera Computer Company in 1988 Burton spent six years with Denelcor, Inc. and three years with the Institute for Defense Analyses. From 1970–1979 he taught at the Massachusetts Institute of Technology and the University of Colorado.

In 2003, Burton received the Seymour Cray Computing Engineering Award from the IEEE Computer Society and was elected to the National Academy of Engineering. He received the Eckert-Mauchly Award in 1991 given jointly by the Institute for Electrical and Electronic Engineers and the Association for Computing Machinery and was elected a fellow of each organization in 1994. Burton attended the University of New Mexico, where he earned a BSEE degree, and the Massachusetts Institute of Technology, where earned SM, EE, and Sc.D degrees.


Tuesday, March 27, 2007, 8:30 AM - 9:30 AM

Chris Johnson, Distinguished Professor
School of Computing, University of Utah

Large-Scale Bioimaging and Visualization

The next decades will see an explosion in the use and the scope of medical imaging, fueled by advanced computing and visualization techniques. In my opinion, advanced, multimodal imaging and visualization techniques, powered by new computational methods, will change the face of biology and medicine and provide comprehensive views of the human body in progressively greater depth and detail. As the resolution of imaging devices continue to increase, image sizes grow accordingly.  Multi-modal and/or longitudinal imaging studies result in large-scale data sets requiring parallel computing and visualization. In this presentation, I will discuss the state-of-the-art in large-scale biomedical imaging and  visualization research, present examples of their vital roles in neuroscience, neurosurgery, radiology, and biology and discuss future challenges.

Professor Johnson directs the Scientific Computing and Imaging Institute at the University of Utah where he is a Distinguished Professor of Computer Science and holds faculty appointments in the Departments of Physics and Bioengineering. His research interests are in the areas of scientific computing and scientific visualization. Dr. Johnson founded the SCI research group in 1992, which has since grown to become the SCI Institute employing over 100 faculty, staff and students. Professor Johnson serves on several international journal editorial boards, as well as on advisory boards to several national and international research centers. Professor Johnson has received several awards, including the the NSF Presidential Faculty Fellow (PFF) award from President Clinton in 1995 and the Governor's Medal for Science and Technology from Governor Michael Leavitt in 1999. In 2003 he received the Distinguished Professor Award from the University of Utah. In 2004 he was elected a Fellow of the American Institute for Medical and Biological Engineering (AIMBE) and in 2005 he was elected a Fellow of the American Association for the Advancement of Science (AAAS).

• Download PDF of presentation


Tuesday, March 27, 2007, 7:00 PM - 10:00 PM

High-performance Computing Methods for Computational Genomics

As biomolecular sequence data continue to be amassed at unprecedented rates, the design of effective computational methods and capabilities that can derive biologically significant information from them has become both increasingly challenging and imperative. In this tutorial, the audience will be first introduced to the different types of biomolecular sequence data and the wealth of information they encode. Following this technical grounding, high-performance computing approaches developed to address some of the most computationally challenging problems in genomics will be described. The contents will be presented in three parts: (i) In the first part, we will describe methods that were designed to query a sequence against a large sequence database. Two popular parallel approaches, mpiBLAST and ScalaBLAST, implementing the NCBI BLAST suite of programs will be described. (ii) Next, we will describe PaCE, which is a parallel DNA sequence clustering algorithm. As direct applications, we will discuss the clustering of large-scale Expressed Sequence Tag data and the assembly of complex genomes. (iii) Finally, we describe GRAPPA, which is a high-performance software suite developed for phylogenetic reconstruction of a collection of genomes or genes.

Throughout the tutorial, emphasis will be on both scalability and effectiveness in exploiting large-scale state-of-the-art supercomputing technologies. The intended audience are academic and industry researchers, educators, and/or commercial application developers, with a computational background. No background in biology is assumed.


Srinivas Aluru is the Stanley Chair in Interdisciplinary
Engineering, Professor of Electrical and Computer Engineering, and Chair of the Bioinformatics and Computational Biology program at Iowa State University. He conducts research in parallel algorithms and applications, bioinformatics and computational biology, and combinatorial scientific computing. Aluru is a recipient of the NSF Career award (1997), IBM faculty award (2002), Iowa State University Foundation award for mid-career achievement in research (2006), Warren B. Boast Undergraduate Teaching Award (2005), and best paper awards at the International Parallel and Distributed Processing Symposium (2006) and Computational Systems Bioinformatics Conference (2005). He is an IEEE Computer Society Distinguished Visitor from 2004 to 2006. He served on numerous program committees and has served in leadership roles at several conference and workshops in parallel processing and computational biology, including serving as Program Chair for HiPC 2007, Program Vice Chair for IPDPS 2007, ICPP 2007 and HiPC 2006. He co-chairs an annual workshop in High Performance Computational Biology and co-edited special issues of the Journal of Parallel and Distributed Computing and IEEE Transactions on Parallel and Distributed Systems on this topic. He edited a comprehensive handbook on computational molecular biology, published in 2005.

David A. Bader is an Associate Professor in Computational Science and Engineering, a division within the College of Computing, Georgia Institute of Technology.  He received his Ph.D. in 1996 from The University of Maryland, was awarded a National Science Foundation (NSF) Postdoctoral Research Associateship in Experimental Computer Science.  He is an NSF CAREER Award recipient, an investigator on several NSF awards, a distinguished speaker in the IEEE Computer Society Distinguished Visitors Program, and is a member of the IBM PERCS team for the DARPA High Productivity Computing Systems program. Dr. Bader serves on the Steering Committees of the IPDPS and HiPC conferences, and was the General co-Chair for IPDPS (2004--2005), and Vice General Chair for HiPC (2002--2004).  David has chaired several major conference program committees: Program Chair for HiPC 2005, Program Vice-Chair for IPDPS 2006 and Program Vice-Chair for ICPP 2006. He has served on numerous conference program committees related to parallel processing and computational science & engineering, is an associate editor for several high impact publications including the IEEE Transactions on Parallel and Distributed Systems (TPDS), the ACM Journal of Experimental Algorithmics (JEA), IEEE DSOnline, and Parallel Computing, is a Senior Member of the IEEE Computer Society and a Member of the ACM.  Dr. Bader has been a pioneer in the field of high-performance computing for problems in bioinformatics and computational genomics. He has co-chaired a series of meetings, the IEEE International Workshop on High-Performance Computational Biology (HiCOMB), written several book chapters, and co-edited special issues of the Journal of Parallel and Distributed Computing (JPDC) and IEEE TPDS on high-performance computational biology. He has co-authored over 80 articles in peer-reviewed journals and conferences, and his main areas of research are in parallel algorithms, combinatorial optimization, and computational biology and genomics.

Ananth Kalyanaraman is an Assistant Professor at the School of Electrical Engineering and Computer Science in Washington State University, Pullman. He received his Ph.D. in Computer Engineering in 2006 and M.S. in Computer Science in 2002, both from Iowa State University, Ames. He received his B.E. in 1998 in Computer Science and Engineering from Visvesvaraya National Institute of Technology, Nagpur, India. His research interests include bioinformatics and computational biology, applied parallel algorithms, and combinatorial pattern matching. A primary thrust in his research is in the development of high-performance computing solutions for computational genomics. Ananth is a recipient of best paper awards at the 2006 IEEE International Parallel and Distributed Processing Symposium (IPDPS'06) and the 2005 IEEE Computational Systems Bioinformatics conference (CSB'05). He has also received Ph.D. fellowships from IBM and Pioneer Hi-Bred International, Inc. He currently serves on the program committees for IPDPS'07 and the 2007 Parallel Bio-Computing Workshop (PBC'07). Ananth is a member of ACM, IEEE, ISCB, LSS, and SIAM.


Wednesday, March 28, 2007, 8:30 AM - 9:30 AM

Michael J. Flynn, Stanford University

Avoiding the Memory Bottleneck through Structured Arrays

Basic to parallel program speedup is dealing with memory bandwidth
requirements. One solution is an architectural arrangement to stream data across multiple processing elements before storing the result in memory. This MISD type of configuration provides multiple operations per data item fetched from memory. One realization of this streamed approach uses FPGAs. We'll discuss both the general memory problem and some results based on work at Maxeler using FPGAs for acceleration.

Michael Flynn is Senior Advisor to the Maxeler Corporation, an acceleration solutions company based in London. He received his Ph.D. from Purdue University and joined IBM working there for ten years in the areas of computer organization and design. He was design manager System 360 Model 91 Central Processing Unit. Between 1966 and 1974 Prof. Flynn was a faculty member of Northwestern University and the Johns Hopkins University. From 1975 until 2000, he was a Professor of Electrical Engineering at Stanford University and served as the Director of the Computer Systems Laboratory from 1977 to 1983. He was founding chairman of both the ACM Special Interest Group on Computer Architecture and the IEEE Computer Society's Technical Committee on Computer Architecture. Prof. Flynn was the 1992 recipient of the ACM/IEEE Eckert-Mauchley Award for his technical contributions to computer and digital systems architecture. He was the 1995 recipient of the IEEE-CS Harry Goode Memorial Award in recognition of his outstanding contribution to the design and classification of computer architecture. In 1998 he received the Tesla Medal from the International Tesla Society (Belgrade), and an honorary Doctor of Science from Trinity College (University of Dublin), Ireland. He is the author of three books and over 250 technical papers, and he is also a fellow of the IEEE and the ACM.


Wednesday, March 28, 2007, 4:00 PM - 6:00 PM

Panel Title:
Is the Multi-Core Roadmap going to Live Up to its Promises?

Panel Moderator:
Per Stenstrom, Chalmers University of Technology

Panel Abstract:
Multi-cores are here to stay, whether we like it or not. With a quadrupling of the core count every three years, chips with hundreds of processor cores are projected in the next decade. The question is, how much of their computational power can be unleashed, what it will take to unleash it, and how best can research accelerate progress?  Several decades of research in multiprocessing has not really made the case. On the other hand, now that coarse-grain parallelism seems to be our only hope and the computing landscape is arguably different, opportunities may arise. The following cross-cutting issues will be debated in this panel with the hope of distilling new avenues for parallelism exploitation:

  • Is the computing landscape (technology, applications, and market) today sufficiently different to exploit multiprocessors from what it was in the past? If yes, in what sense? If not, why?
  • Do we need more research in multiprocessing given past work? If yes, what are the biggest challenges? If not, state the reasons.
  • Will progress in software/architecture make it possible to make
    sequential languages prevail? If yes, what are the top priorities in research to make that happen? If not, what are the visions for a parallel-language paradigm shift and what are the major challenges in software/architecture research to accelerate uptake in the programming community?
  • Would multi-disciplinary research (across the applications,
    algorithms, software, and architecture areas) be a good way to accelerate developments? Then, what areas should interact more closely and with what goals in mind?


Wednesday, March 28, 2007, 7:30 PM - 9:30 PM

Dr. Mark K. Seager,
Assistant Dept Head for Advanced Technology Integrated Computing and Communications Department, Lawrence Livermore National Laboratory

Why Peta-Scale is Different: An Ecosystem Approach to Predictive
Scientific and Engineering Simulation

With the recent advent of 100s of teraFLOP/s-scale simulations capability at Lawrence Livermore National Laboratory and other sites, it has become clear that the scientific method has changed. This transition has taken us from theory and experiment to theory and experiment being tightly integrated by simulation. With the advent of peta-scale simulations on the horizon it is appropriate to take stock of the recent advances and to look forward to the coming wave of future systems.

In this talk we focus on some areas of science that open up with peta-scale systems and how this is VERY different from the science one can accomplish with a single workstation (giga-scale simulation). In actual fact, the science enabled by tera-scale and peta-scale systems require a whole new approach to the scientific method.  One of the things we are starting to realize being at the leading edge of applying this new technology, is that with the coming onset of peta-scale simulations (systems, visualization, and applications) is that we may be headed for huge scientific breakthroughs enabled and driven by simulation. This is not just hype (there is already plenty of that), we give specific examples of where these breakthroughs are may occur and why. Another major ramification of this scientific simulation transformation is that the development, deployment and gainful employment of tera-scale->peta-scale simulations requires a vastly different approach from a professor and a few graduate students writing a code, doing scaling studies and publishing a few papers. There is still a place for this type of research.  Indeed, it is the development foundation of techniques employed in larger simulations. However, the real world problems that are now becoming tractable to solve with peta-scale simulations require a multi-disciplinary, multi-physics, multi-scale approach that is way beyond what a single researcher and graduate students can accomplish.

This scale of computation is driving fundamental changes in platform design, infrastructure and the methods by which applications are developed. In the area of platform development, highly scalable systems are being proposed by multiple vendors to achieve a sustained petaFLOP/s on real scientific simulations. These systems are characterized by massive numbers of cores, memory and corresponding huge power requirements. Simulation environments proposed for these systems rely on shared file systems, visualization, and data assessment assets tightly coupled with the platform. We discuss techniques that may be used to utilize these complex system of systems.

Dr. Seager received his B.S. Degree in Mathematics and Astrophysics at the University of New Mexico at Albuquerque in 1979 and received his PhD in Numerical Analysis from the University of Texas at Austin in 1984. Mark started working at Lawrence Livermore National Laboratory in 1983 and has been working in the field of parallel processing ever since. He manages the Platforms Program for the Advanced Simulation and Computing Initiative (ASCI) Program at LLNL and has successfully managed partnerships to successfully deploy architectures such as ASCI Blue Pacific (3.9 TF/s in 1998), ASCI White (12.3 TF/s in 2000) and the powerful LLNL Linux clusters (MCR at 11.3 TF/s in 2002 and Thunder at 23 TF/s in 2004). He has also managed the IBM contract for ASCI Purple (100 TF/s in 2005) and BlueGene/L (180/360 TF/s in 2005).  His current interests include advanced technology and scalable systems architecture, performance and commodity based high performance computing.


Thursday, March 29, 2007, 8:30 AM - 9:30 AM

Professor Umesh Vazirani, University of California Berkeley

Quantum Physics and the Nature of Computation

Quantum physics is a fascinating area from a computational viewpoint. The features that make quantum systems prohibitively hard to simulate
classically are precisely the aspects exploited by quantum computation to obtain exponential speedups over classical computers. In this talk I will survey our current understanding of the power (and limits) of quantum computers, and prospects for experimentally realizing them in the near future. I will also touch upon insights from quantum comuptation that have resulted in new classical algorithms for efficient simulation of certain important quantum systems.

Umesh Vazirani received his B.Tech in Computer Science from M.I.T. in 1981 and his PhD in Computer Science from U.C. Berkeley in 1985. He is on the faculty in Computer Science at U.C. Berkeley, where he is director of the Berkeley Quantum Computing Center, and holder of the Strauch Chair in Computer Science. Prof. Vazirani is a theoretician with broad interests in algorithms, complexity theory and novel models of computation. He has done seminal work in quantum computation and on the computational foundations of randomness. His books include "An Introduction to Computational Learning Theory" (with Michael Kearns, MIT Press, 1995), and "Algorithms" (with Sanjoy Dasgupta and Christos Papadimitriou, MIT press, 2006).


Click here for registration details

Click Here for Online Registration

Especially for IPDPS attendees. Discounted Lunch Options available Tuesday through Friday. Details include daily menus.

. Click here for details (pdf)


Burton Smith
Microsoft Corp.

Christopher Johnson

University of Utah

Michael J. Flynn

Stanford University

Mark Seager

Lawrence Livermore National Labs

Umesh Vazirani
UC Berkeley

March 2, 2007
Hotel registration at special rates ends.

March 5, 2007
Advance discount on registration fees expires at 12:00 AM MST (GMT-7). Online registration will be available to end of conference.

March 26-30, 2007
Conference Dates


Copyright © 2007. All rights reserved. Designed & Maintained by MediaGirl