Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA)
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.
Submission Guidelines
Authors are invited to submit manuscripts in English structured as
technical papers not exceeding 8 letter size (8.5x11) pages including
figures, tables, and references using the ACM SIGS format for conference
proceedings. Submissions not conforming to these guidelines may be
returned without review. Reference style files are available at
http://www.acm.org/sigs/publications/proceedings-templates#aL1.
All manuscripts will be reviewed and judged
on correctness, originality, technical strength, and significance,
quality of presentation, and interest and relevance to the workshop
attendees. Submitted papers must represent original unpublished research
that is not currently under review for any other conference or journal.
Papers not following these guidelines will be rejected without review
and further action may be taken, including (but not limited to)
notifications sent to the heads of the institutions of the authors and
sponsors of the conference. Submissions received after the due date,
exceeding length limit, or not appropriately structured may also not be
considered. At least one author of an accepted paper must register for
and attend the workshop. Authors may contact the workshop program chair
for more information.
Papers should be submitted electronically at: http://www.easychair.org/conferences/?conf=scala20130.
Full papers will be published with the SC 2013 workshop proceedings in
the ACM digital library. Selected papers will be invited for an extended
version in a special issue of the Journal of Computational Science (JoCS).
Important Dates
- Full paper submission (firm):
5 September, 2013
- Notification of acceptance:
16 September, 2013
- Final paper submission (firm):
7 October, 2013
Topics
Topics of interest include, but are not limited to:
- Novel scientific algorithms that improve performance, scalability,
resilience, and power efficiency
- Porting scientific algorithms and applications to many-core and
heterogeneous architectures
- Performance and resilience limitations of scientific algorithms and
applications at scale
- Crosscutting approaches (system software and applications) in
addressing scalability challenges
- Scientific algorithms that can exploit extreme concurrency
(e.g. 1 billion for exascale by 2020)
- Naturally fault tolerant, self-healing, or fault oblivious scientific
algorithms
- Programming model and system software support for algorithm
scalability and resilience
Workshop Chairs
- Prof. Vassil Alexandrov, Barcelona Supercomputing Center, Spain
- Al Geist, Oak Ridge National Laboratory, USA
- Prof. Jack Dongarra, The University of Tennessee, USA
Workshop Program Chair
- Dr. Christian Engelmann, Oak Ridge National Laboratory, USA
Program Committee
- Prof. Vassil Alexandrov, Barcelona Supercomputing Center, Spain
- Dr. Rick Archibald, Oak Ridge National Laboratory, USA
- Dr. David E. Bernholdt, Oak Ridge National Laboratory, USA
- Prof. George Bosilca, University of Tennessee, USA
- Dr. Greg Bronevetsky, Lawrence Livermore National Laboratory, USA
- Prof. Marian Bubak, AGH University of Science and Technology,
Krakow, Poland and University of Amsterdam, The Netherlands
- Prof. Zizhong Chen, University of California, Riverside, USA
- Prof. Jack Dongarra, The University of Tennessee, USA
- Dr. Christian Engelmann, Oak Ridge National Laboratory, USA
- Al Geist, Oak Ridge National Laboratory, USA
- Dr. Kirk E. Jordan, IBM T.J. Watson Research, USA
- Prof. Dieter Kranzlmueller, Ludwig-Maximilians-University Munich, Germany
- Prof. Ron Perrot, Queen's University Belfast, UK
- Dr. Nageswara Rao, Oak Ridge National Laboratory, USA
- Dr. Clayton Webster, Oak Ridge National Laboratory, USA
Venue
- Room 507 (Street Level, Near 'E' Lobby), Colorado Convention Center, 700 14th St, Denver, CO 80202, USA
Program
- 09:00-10:00 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 (Abstract)
- 10:00-10:30 Coffee break (coffee provided)
- 10:30-12:05 Session 2
- 10:30-11:15 Keynote 2: "Extreme Scaling on SuperMUC," Dieter Kranzlmueller, Ludwig-Maximilians-University Munich, Germany (Abstract)
- 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)
- 13:30-15:05 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 (Abstract)
- 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)
- 15:30-17:30 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 (Abstract)
- 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