Tuesday Dec. 18th
8 :3 0 a m - 8 :4 0 a m
OPENING REMARKS
Viktor K. Prasanna
Sriram Vajapeyam
Burkhard Monien
8 :4 0 a m - 9 :4 0 a m
KEYNOTE ADDRESS
"Instability
of FIFO and of Mixings of Stable Policies for Networks"
Paul Spirakis
Computer Technology Institute of Greece
Paul Spirakis obtained his Ph. D. from Harvard University in 1982. He
became a full Professor at the University of Patras, Greece in 1990. He
is currently the director of the Computer Technology Institute of Greece.
He won the top prize of the Greek Math Association in 1973, and is a Distinguished
Visiting Scientist of Max Planck Informatik. His research interests include
probabilistic algorithms, parallel and distributed algorithms and network
protocols, exact analysis of algorithms, algorithms for mobile computing,
and experimental algorithms as well as complexity of problems. He is a
member of the Council of EATCS, the Greek representative in the European
Union for Information Society and a consultant to the Greek State, the
EU as well as to major Greek firms in Informatics. He is a member of scientific
program or steering committees of the major conferences in his field. He
is also a member of ACM, EATCS, Math Society of America, and the Greek
Computer Society.
1 0 :0 0 a m - n o o n
SESSION I
Algorithms
Chair: J. L.V. Lewandowski
Princeton University
Mesh
Algorithms for Multiplication and Division
S. Rao Kosaraju, The Johns Hopkins University
Compact
Routing in Directed Networks with Stretch Factor of Two
Punit Chandra and Ajay Kshemkalyani,
University of Illinois at Chicago
Parametric
Scheduling - Algorithms & Complexity
K. Subramani, West Virginia University,
Morgantown
An
Efficient Algorithm for Computing Lower Bounds on Time and Processors for
Scheduling Precedence Graphs on Multicomputer Systems
B. S. Panda, University of Hyderabad and
Sajal K. Das, University of Texas at Arlington
On
Job Scheduling for HPC-Clusters and the dynP Scheduler
Achim Streit, University of Paderborn
An
Adaptive Scheme for Fault-Tolerant Scheduling of Soft Real-Time Tasks in
Multiprocessor Systems
R. Al-Omari, Arun K. Somani, and
G. Manimaran, Iowa State University
1 :0 0 p m - 2 :0 0 p m
KEYNOTE ADDRESS
"Whither
MPI: Lessons From and the Future of MPI"
William Gropp
Argonne National Laboratory
William Gropp received Ph. D. in Computer Science from Stanford University
in 1982. He is a Senior Computer Scientist and Associate Director of the
Mathematics and Computer Science Division at Argonne, a Senior Scientist
in the Dept. of Computer Science at the University of Chicago, and a senior
fellow in the Argonne-University of Chicago Computation Institute. His
research interests are in parallel computing, software for scientific computing,
and numerical methods for partial differential equations. Dr. Gropp has
played a major role in the development of the MPI message-passing standard.
He is co-author of MPICH, the most widely used implementation of MPI, and
was involved in the MPI Forum as a chapter author for both MPI-1 and MPI-2.
He has written many books and papers on MPI, including "Using MPI" and
"Using MPI-2". Dr. Gropp is also one of the designers of the PETSc parallel
numerical library and has developed efficient and scalable parallel algo-rithms
for the solution of linear and nonlinear equations. In addition, he is
involved in several other advanced computing projects, including performance
modeling, data structure modifi-cation for ultra-high-performance computers,
and development of component-based soft-ware to promote interoperability
among numerical toolkits.
2 :1 5 p m - 4 :1 5 p m
SESSION II
Applications
Chair: P. J. Narayanan
Indian Institute of Information Technology,
Hyderabad
Gyrokinetic
Simulations of Plasma Turbulence on Massively Parallel Computers
J. L. V. Lewandowski, Z. Lin, W. W. Lee,
T. S. Hahm, and W.M. Tang, Princeton University
A
Parallel Krylov-type Method for Nonsymmetric Linear Systems
Anthony T. Chronopoulos, University of Texas,
San Antonio and Andrey B. Kucherov,
Moscow State University
Evolving
Cellular Automata Based Associative Memory for Pattern Recognition
Niloy Ganguly, IISWBM, Calcutta and
Arijit Das, Pradipta Maji, Biplab K. Sikdar,
and P. Pal Chaudhuri, Bengal Engineering
College
Efficient
Parallel Algorithms and Software for Compressed Octrees with Applications
to Hierarchical Methods
Bhanu Hariharan and Srinivas Aluru,
Iowa State University
A
Case Study of Improving Memory Locality In Polygonal Model Simplification:
Metrics and Performance
Victor Salamon and Paul Lu, University of
Alberta, Ben Watson and Dima Brodsky,
Northwestern University and Dave Gomboc,
The University of British Columbia
4 :3 0 p m - 6 :3 0 p m
POSTER/PRESENTATION SESSION
This session will emphasize novel applications of high performance
computing. It will offer a brief presentation time for each poster followed
by a walk-up and talk setting.
For submission details, contact:
Chair: Sartaj Sahni
Email: [email protected]
List of accepted posters.
7 :0 0 p m - 1 0 :0 0 p m
BANQUET AND CULTURAL PROGRAM
Banquet Speaker: S. Ramadorai
CEO, Tata Consultancy Services
Mr Ramadorai has played a pioneering role in establishing TCS's Offshore
Development Centers (ODCs) in India to provide high-end solutions to major
multi-national corporations. Furthermore, Ramadorai has spearheaded TCS'
quality initiatives, taking thirteen of its Development Centers in India
to SEI's CMM Level 5, the highest and most prestigious performance assessment
issued by the Software Engineering Institute (SEI).
Mr Ramadorai holds a Bachelors degree in Physics from Delhi University,
India, a Bachelor of Engineering degree in Electronics and Telecommunications
from the Indian Institute of Science, India, and a Masters degree in Computer
Science from the University of California, USA. In 1993, Ramadorai took
the Senior Executive Development Program at MIT's Sloan School of Management.
|
