[hpc-announce] Call for Papers: ScalA at SC 2017 - Papers due August 28

[Engelmann, Christian]

We apologize if you receive multiple copies of this notice.

-----------------------------------------------------------------------------

          ScalA’17: 8th Workshop on Latest Advances in
           Scalable Algorithms for Large-Scale Systems

                  held in conjunction with the
     SC17: The International Conference on High Performance
           Computing, Networking, Storage and Analysis

                in cooperation with ACM SIGHPC 

              November 13, 2017, Denver, CO, USA

      <http://www.csm.ornl.gov/srt/conferences/Scala/2017>

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.5in x 11in) pages including figures,
tables, and references using the ACM 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>.

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:
<https://easychair.org/conferences/?conf=scala17>.

Full papers will be published with the SC'17 workshop proceedings in the ACM
Digital Library and IEEE Xplore. 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: August 28, 2017
- Notification of acceptance: September 11, 2017
- Final paper submission (firm): October 9, 2017
- Workshop/conference early registration: TBD
- Workshop: November 13, 2017

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

- 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

Program Committee

- Vassil Alexandrov, Barcelona Supercomputing Center, Spain
- Hartwig Anzt, University of Tennessee, Knoxville, USA
- Rick Archibald, Oak Ridge National Laboratory, USA
- Franck Cappello, Argonne National Laboratory and
  University of Illinois at Urbana Champaign, USA
- Zizhong Chen, University of California, Riverside, USA
- James Elliott, Sandia National Laboratories, USA
- Nahid Emad, University of Versailles SQ, France
- Christian Engelmann, Oak Ridge National Laboratory, USA
- Wilfried Gansterer, University of Vienna, Austria
- Michael Heroux, Sandia National Laboratories, USA
- Kirk E. Jordan, IBM T.J. Watson Research, USA
- Dieter Kranzlmueller, Ludwig-Maximilians-University Munich, Germany
- Ignacio Laguna, Lawrence Livermore National Laboratory, USA
- 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

--

Christian Engelmann, Ph.D.

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 at ornl.gov / Home: www.christian-engelmann.info