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 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 scientific applications require novel
mathematical models and system software that address the scalability and
resilience challenges of current- and future-generation extreme-scale
HPC systems.
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=scala2012.
Full papers will be published with the SC 2012 workshop proceedings in
the IEEE digital library. Selected papers will be invited for an extended
verson in a special issue of the Journal of Computational Science (JoCS).
Important Dates
- Full paper submission (IEEE format):
1 October, 2012
- Notification of acceptance:
17 October, 2012
- Final paper submission (IEEE format):
7 December, 2012
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
- Dr. Franck Cappello, INRIA/UIUC, France/USA
- 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. Michael A. Heroux, Sandia National Laboratories, 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
- Nageswara Rao, Oak Ridge National Laboratory, USA
- Prof. Stephen L. Scott, Tennessee Tech University and Oak Ridge National Laboratory, USA
- Dr. Clayton Webster, Oak Ridge National Laboratory, USA
Venue
- Salt Palace Convention Center, Room 255-B
Program
- 08:45-09:00: Opening
Prof. Vassil Alexandrov (Barcelona Supercomputing Center, Spain) - 09:00-10:00: Invited talk - "The Many-task Revolution: Alternative Programming Paradigms," (Abstract)
Prof. George Bosilca (University of Tennessee, USA) - 10:00-10:30: Coffee Break
- 10:30-11:30: Papers
- 10:30-11:00: "A Highly Scalable Approach for Time Parallelization of Long Range Forecasts,"
Vishwas Hebbur Venkata Subba Rao (Virginia Tech University, USA),
Alexandru Cioaca (Virginia Tech University, USA), and
Adrian Sandu (Virginia Tech University, USA) - 11:00-11:30: "A Task Parallelism Meets Fast Multipole Methods,"
Kenjiro Taura (University of Tokyo, Japan),
Jun Nakashima (University of Tokyo, Japan),
Rio Yokota (King Abdullah University of Science and Technology, Saudi Arabia), and
Naoya Maruyama (RIKEN Advanced Institute for Computational Science, Japan)
- 11:30-12:30: Invited talk - "Communication-Avoiding Algorithms for Linear Algebra and Beyond," (Abstract)
Prof. James Demmel (University of California at Berkeley, USA) - 12:30-13:30: Lunch Break
- 13:30-15:00: Papers
- 13:30-14:00: "Performance and Power Characteristics of Matrix Multiplication Algorithms on Multicore and Shared Memory Machines,"
Yonghong Yan (University of Houston, USA),
Jeremy Kemp (University of Houston, USA),
Xiaonan Tian (University of Houston, USA),
Abid Muslim Malik (University of Houston, USA), and
Barbara Chapman (University of Houston, USA) - 14:00-14:30: "GPU-based Parallelization of Kernel Polynomial Method for Solving LDOS,"
Shixun Zhang (University of Tsukuba, Japan),
Shinichi Yamagiwa (University of Tsukuba, Japan), and
Seiji Yunoki (RIKEN / JST CREST, Japan) - 14:30-15:00: "Improving Fault Tolerance and Accuracy of Distributed Reduction Algorithms,"
Gerhard Niederbrucker (University of Vienna, Austria),
Hana Strakova (University of Vienna, Austria), and
Wilfried Gansterer (University of Vienna, Austria)
- 15:00-15:30: Coffee Break
- 15:30-16:30: Invited talk - "Algorithmic and Software Challenges when Moving Towards Exascale," (Abstract)
Prof. Jack Dongarra (University of Tennessee, USA) - 16:30-17:00: Discussion
- 17:00-17:30: Concluding Remarks
Prof. Vassil Alexandrov (Barcelona Supercomputing Center, Spain)