Saturday, 9 November 2013

Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA) 2013

Workshop on Latest Advances in Scalable
            Algorithms for Large-Scale Systems (ScalA) 2013
         <http://www.csm.ornl.gov/srt/conferences/Scala/2013>

                      held in conjunction with
             SC13: The International Conference for High
       Performance Computing, Networking, Storage and Analysis

                   in cooperation with ACM SIGHPC

Novel scalable scientific algorithms are needed in order to enable key
science applications to exploit the computational power of large-scale
systems. This is especially true for the current tier of leading petascale
machines and the road to exascale computing as HPC systems continue to
scale up in compute node and processor core count. These extreme-scale
systems require novel scientific algorithms to hide network and memory
latency, have very high computation/communication overlap, have minimal
communication, and have no synchronization points.

Scientific algorithms for multi-petaflop and exa-flop systems also need
to be fault tolerant and fault resilient, since the probability of faults
increases with scale. Resilience at the system software and at the
algorithmic level is needed as a crosscutting effort. Finally, with the
advent of heterogeneous compute nodes that employ standard processors as
well as GPGPUs, scientific algorithms need to match these architectures
to extract the most performance. This includes different system-specific
levels of parallelism as well as co-scheduling of computation. Key science
applications require novel mathematical models and system software that
address the scalability and resilience challenges of current- and
future-generation extreme-scale HPC systems.

Date: November 18, 2013, Denver, CO, USA

Venue: Room 507 (Street Level, Near 'E' Lobby)
             Colorado Convention Center, 700 14th St, Denver, CO 80202, USA

Program:

 Session 1:
   09:00-09:15 Opening
   09:15:10:00 Keynote 1:
                          "Toward the Next Generation of Parallel and Resilient Algorithms,"
                          Michael A. Heroux, Sandia Laboratories, USA

 10:00-10:30 Coffee break (coffee provided)

 Session 2:
   10:30-11:15 Keynote 2:
                          "Extreme Scaling on SuperMUC,"
                          Dieter Kranzlmueller, Ludwig-Maximilians-University Munich, Germany
   11:15-11:40 Paper 1:
                          "Using HPX and LibGeoDecomp for Scaling HPC Applications on
                            Heterogeneous Supercomputers,"
                          Thomas Heller, Hartmut Kaiser, Andreas Schaefer, and Dietmar Fey
   11:40-12:05 Paper 2:
                          "CPU-GPU Hybrid Bidiagonal Reduction With Soft Error Resilience,"
                          Yulu Jia, Piotr Luszczek, George Bosilca, and Jack Dongarra

 12:05-13:30 Lunch break (lunch on your own)

 Session 3:
   13:30-14:15 Keynote 3:
                          "Algorithms for Dynamic Data Driven Applications Systems
                           (DDDAS/InfoSymbiotics),"
                          Frederica Darema, Air Force Office of Scientific Research, USA
   14:15-14:40 Paper 3:
                          "A Study of Application-Level Recovery Methods for Transient
                           Network Faults,"
                          Ignacio Laguna, Edgar A. Leon, Martin Schulz, and Mark Stephenson
   14:40-15:05 Paper 4:
                          "Self-stabilizing Iterative Solvers,"
                          Piyush Sao and Richard Vuduc

 15:05-15:30 Coffee break (coffee provided)

 Session 4:
   15:30-16:15 Keynote 4:
                          "Algorithmic and Software Challenges For Numerical Libraries
                            at Exascale,"
                          Jack Dongarra, The University of Tennessee, Knoxville, USA
   16:15-16:40 Paper 5:
                           "CUDA Acceleration of a Matrix-Free Rosenbrock-K method
                             applied to the Shallow Water Equations,"
                           Paul Tranquilli, Ross Glandon, and Adrian Sandu
   16:40-17:05 Paper 6:
                          "On Scalability Behaviour of Monte Carlo Sparse Approximate
                            Inverse for Matrix Computations,"
                          Janko Strassburg and Vassil Alexandrov
   17:05-17:30 Closing

--

Christian Engelmann, Ph.D.

System Software Team Task Lead / R&D Staff Scientist
Computer Science Research Group
Computer Science and Mathematics Division
Oak Ridge National Laboratory

Mail: P.O. Box 2008, Oak Ridge, TN 37831-6173, USA
Phone: +1 (865) 574-3132 / Fax: +1 (865) 576-5491
e-Mail: engelmannc@ornl.gov / Home: www.christian-engelmann.info

No comments:

Post a Comment