ScalA18: 9th 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 8 letter size (8.5in x 11in) pages and
not exceeding 8 pages, including figures, tables, and references using the IEEE
format for conference proceedings. Submissions not conforming to these
guidelines may be returned without review. Reference style files are available
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 present the paper at the workshop. Authors may contact the workshop program chair
for more information. Papers should be submitted electronically at
Full papers will be published with the SC18 workshop proceedings in the IEEE
Xplore Digital Library.
As part of a major initiative that aims to increase the level of reproducibility
and replicability of results, ScalA'18 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
Further information about the SC Reproducibility Initiative can be found at
including a template for the Artifact Description Appendix at https://collegeville.github.io/sc-reproducibility/ArtifactDescriptionAppendixTemplate.html.
- Full paper submission: September 9, 2018
- Notification of acceptance: October 1, 2018
- Final paper submission (firm): October 15, 2018
- Workshop/conference early registration: October 14, 2018
- Workshop: November 12, 2018
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, Barcelona Supercomputing Center, Spain
- Al Geist, Oak Ridge National Laboratory, USA
- Jack Dongarra, University of Tennessee, Knoxville, USA
Workshop Program Chair
- Christian Engelmann, Oak Ridge National Laboratory, USA
- Hartwig Anzt, University of Tennessee, Knoxville, USA
- Rick Archibald, Oak Ridge National Laboratory, USA
- 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
- Kirk E. Jordan, IBM T.J. Watson Research, USA
- Dieter Kranzlmueller, Ludwig-Maximilians-University Munich, Germany
- Sriram Krishnamoorthy, Pacific Northwest National Laboratory, USA
- Ignacio Laguna, Lawrence Livermore National Laboratory, USA
- Ying Liu, University of Chinese Academy of Sciences, China
- Piotr Luszczek, University of Tennessee, Knoxville, USA
- Michael Mascagni, Florida State University, USA
- Ron Perrot, University of Oxford, UK
- Yves Robert, ENS Lyon, France
- Stuart Slattery, Oak Ridge National Laboratory, USA
- Keita Teranishi, Sandia National Laboratories, USA
The full workshop program is also listed in the SC online program: Session - 9th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems
- 09:00-10:00 Session 1
- 09:00-09:10 Introduction: Vassil Alexandrov (Barcelona
Supercomputing Center, Spain).
- 09:10-10:00 Keynote 1: "Few Scheduling Problems for Resilience at Scale," Yves Robert (ENS Lyon, France). (abstract)
- 10:00-10:30 Coffee break (coffee provided)
- 10:30-12:30 Session 2
- 10:30-11:10 Keynote 2: "HPC and AI as Drivers for Industrial Engagement," Alison Kennedy (Hartree Centre, Daresbury Laboratory, UK). (abstract)
- 11:10-11:30 Paper 1: "Event-Triggered Communication in Parallel Computing," Soumyadip Ghosh, Kamal Saha, Vijay Gupta, and Gretar Tryggvason.
- 11:30-11:50 Paper 2: "Communication Reduced Multi-Timestep Algorithm for Real-Time Wind Simulation on GPU-Based Supercomputers," Naoyuki Onodera, Yasuhiro Idomura, Yussuf Ali, and Takashi Shimokawabe.
- 11:50-12:10 Paper 3: "Communication Avoiding Multigrid Preconditioned Conjugate Gradient Method for Extreme Scale Multiphase CFD Simulations," Yasuhiro Idomura, Takuya Ina, Susumu Yamashita, Naoyuki Onodera, Susumu Yamada, and Toshiyuki Imamura.
- 12:10-12:30 Paper 4: "Non-Collective Scalable Global Network Based on Local Communications," Marco Berghoff and Ivan Kondov
- 12:30-14:00 Lunch break (lunch on your own)
- 14:00-15:00 Session 3
- 14:00-14:20 Paper 5: "Iterative Randomized Algorithms for Low Rank Approximation of Terascale Matrices with Small Spectral Gaps," Chander J. Iyer, Alex Gittens, Christopher D. Carothers, and Petros Drineas.
- 14:20-14:40 Paper 6: Shift-Collapse Acceleration of Generalized Polarizable Reactive Molecular Dynamics for Machine Learning-Assisted Computational Synthesis of Layered Materials," Kuang Liu, Subodh Tiwari, Chunyang Sheng, Aravind Krishnamoorthy, Sungwook Hong, Pankaj Rajak, Rajiv K. Kalia, Aiichiro Nakano, Ken-ichi Nomura, Priya Vashishta, Manaschai Kunaseth, Saber Naserifar, William A. Goddard III, Ye Luo, Nichols A. Romero, and Fuyuki Shimojo.
- 14:40-15:00 Paper 7: "Machine Learning-Aided Numerical Linear Algebra: Convolutional Neural Networks for the Efficient Preconditioner Generation," Markus Götz and Hartwig Anzt.
- 15:00-15:30 Coffee break (coffee provided)
- 15:30-17:30 Session 4
- 15:30-16:10 Keynote 3: "Hierarchical Algorithms on Hierarchical Architectures," David Keyes (King Abdullah University of Science and Technology, Saudi Arabia). (abstract)
- 16:10-16:30 Paper 8: "Low Thread-count Gustavson: A multithreaded algorithm for sparse matrix-matrix multiplication using perfect hashing," James Elliott and Christopher Siefert.
- 16:30-16:50 Paper 9: "A General-Purpose Hierarchical Mesh Partitioning Method with Node Balancing Strategies for Large-Scale Numerical Simulations," Fande Kong, Roy H. Stogner, Derek R. Gaston, John W. Peterson, Cody J. Permann, Andrew E. Slaughter, and Richard C. Martineau.
- 16:50-17:10 Paper 10: "Dynamic Load Balancing of Plasma and Flow Simulations," Gerrett Diamond, Cameron Smith, Eisung Yoon, and Mark Shephard.
- 17:10-17:30 Paper 11: "On Advanced Monte Carlo Methods for Linear Algebra on Advanced Accelerator Architectures," Anton Lebedev and Vassil Alexandrov.