Tuesday, 13 August 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

                   November 18, 2013, Denver, CO, USA

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): 10 October, 2013
- Workshop: 18 November, 2013

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)
- 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. 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

--

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