ScalA19: 10th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems
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
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.
Authors are invited to submit manuscripts in English structured as
technical papers at a length of at least 6 letter size (8.5in x 11in) pages and
not exceeding 8 pages, including figures, tables, and references using the IEEE
format for conference proceedings. Reference style files are available at http://www.ieee.org/conferences_events/conferences/publishing/templates.html.
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. Papers should be submitted electronically
All manuscripts will be peer-reviewed and judged on correctness,
originality, technical strength, and significance, quality of presentation, and
interest and relevance to the workshop attendees. Accepted papers will be
published with the IEEE Computer Society as part of the SC19 workshop
proceedings in the IEEE Xplore Digital Library. At least one author of an
accepted paper must register for and present the paper at the workshop. Authors
may contact the workshop program chair, Christian Engelmann at firstname.lastname@example.org, for more information.
As part of a major initiative that aims to increase the level of reproducibility
and replicability of results, ScalA19 invites authors of technical papers to
submit optional appendix information that can promote better reproducibility of
computational results. Authors are highly encouraged to provide a 2-page
Artifact Description Appendix, which will not count toward the page limit of the
- A paper cannot be disqualified based on information provided or not
provided in this appendix, nor if the appendix is not available.
- The availability and quality of an appendix can be used in ranking a
paper. In particular, if two papers are of similar quality, the
existence and quality of the appendices can be part of the evaluation
- Appendices should not be used to circumvent the page limit.
Further information about the SC Reproducibility Initiative can be found at
- Full paper submission: September 9, 2019
- Notification of acceptance: September 30, 2019
- Final paper submission (firm): October 11, 2019
- Workshop/conference early registration: TBD
- Workshop: November 18, 2019
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
- 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
- Programming model and system software support for algorithm
scalability and resilience
- Vassil Alexandrov, Hartree Centre, Science and Technology Facilities Council, UK
- Al Geist, Oak Ridge National Laboratory, USA
- Jack Dongarra, University of Tennessee, Knoxville, USA
- Hartwig Anzt, University of Tennessee, Knoxville, USA
- Rick Archibald, Oak Ridge National Laboratory, USA
- Marco Berghoff, Karlsruhe Institute of Technology, Germany
- Hans-Joachim Bungartz, Technical University of Munich, Germany
- Franck Cappello, Argonne National Laboratory and University of Illinois at Urbana Champaign, USA
- James Elliott, Sandia National Laboratories, USA
- Nahid Emad, University of Versailles SQ, France
- Wilfried Gansterer, University of Vienna, Austria
- Yasuhiro Idomura, Japan Atomic Energy Agency
- Kirk E. Jordan, IBM T.J. Watson Research, USA
- Dieter Kranzlmueller, Ludwig-Maximilians-University Munich, Germany
- Sriram Krishnamoorthy, Pacific Northwest National Laboratory, USA
- Paul Lin, Sandia National Laboratories
- Yves Robert, ENS Lyon, France
- Stuart Slattery, Oak Ridge National Laboratory, USA
- Keita Teranishi, Sandia National Laboratories, USA
The workshop program is also listed in the SC online program: Session - 10th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems
- 09:00-10:00 Session 1
- 09:00-10:00 Keynote 1: "Exascale Application Progress and Challenges," Dr. Douglas B. (Doug) Kothe (Oak Ridge National Laboratory) and Lori A. Diachin (Lawrence Livermore National Laboratory).
- 10:00-10:30 Coffee break (coffee provided)
- 10:30-12:30 Session 2
- 10:30-11:30 Keynote 2: "Towards Scaling Deep Learning to 100,000 processors - The Fugaku Challenge," Prof. Satoshi Matsuoka (RIKEN Center for Computational Science and Tokyo Institute of Technology) (Presentation).
- 11:30-11:50 Paper 1: "GPU Acceleration of Communication Avoiding Chebyshev Basis Conjugate Gradient Solver for Multiphase CFD Simulations," Yussuf Ali, Naoyuki Onodera, Yasuhiro Idomura, Takuya Ina, and Toshiyuki Imamura (Presentation).
- 11:50-12:10 Paper 2: "Optimization of a Solver for Computational Materials and Structures Problems on NVIDIA Volta and AMD Instinct GPUs," Mohammad Zubair, James Warner, and David Wagner (Presentation).
- 12:10-12:30 Paper 3: "Towards Half-Precision Computation for Complex Matrices: A Case Study for Mixed Precision Solvers on GPUs," Ahmad Abdelfattah, Stanimire Tomov, and Jack Dongarra (Presentation).
- 12:30-14:00 Lunch break (lunch on your own)
- 14:00-15:00 Session 3
- 14:00-15:00 Keynote 3: "The Extreme-scale Scientific Software Stack and its promise for the Exascale Computing Era," Dr. Michael Heroux (Sandia National Laboratories) (Presentation).
- 15:00-15:30 Coffee break (coffee provided)
- 15:30-17:30 Session 4
- 15:30-15:50 Paper 4: "Extreme Scale Phase-Field Simulation of Sintering Processes," Henrik Hierl, Johannes Hötzer, Marco Seiz, Andreas Reiter, and Britta Nestler (Presentation).
- 15:50-16:10 Paper 5: "Generic matrix multiplication for multi-GPU accelerated distributed-memory platforms over PaRSEC," Thomas Herault, Yves Robert, George Bosilca, and Jack Dongarra (Presentation).
- 16:10-16:30 Paper 6: "Towards Accelerated Unstructured Mesh Particle-in-Cell," Gerrett Diamond, Cameron Smith, and Mark Shephard (Presentation).
- 16:30-16:50 Paper 7: "Parallel Multigrid Methods on Manycore Clusters with IHK/McKernel," Kengo Nakajima, Balazs Gerofi, Yutaka Ishikawa, and Masashi Horikoshi (Presentation).
- 16:50-17:10 Paper 8: "Making Speculative Scheduling Robust to Incomplete Data," Ana Gainaru and Guillaume Pallez (Presentation).
- 17:10-17:30 Paper 9: "Parallel SFC-based mesh partitioning and load balancing," Ricard Borrell, Gillermo Oyarzun, Damien Dosimont, and Guillaume Houzeaux (Presentation).