[hpc-announce] [IPDPS] CfP - The Programming Models and Algorithms Workshop (PMAW'18)

[Kong, Martin]

[Call for Papers]

PMAW: The Programming Models and Algorithms Workshop

Held in Conjunction with IPDPS'18

https://pmaw.github.io

The purpose of this workshop is to bring together experts of different areas to
bridge the gap between programming models and algorithms in general. The
ultimate goal is to foster the interdisciplinary relationships among domain
scientists, and compiler, language and runtime (CLR) experts in order to
re-design and rethink the next generation of algorithms that will be used
during the forthcoming decades. Therefore, the intended audience and
participants of the proposed workshop involves experts, practitioners,
students, professors and researchers of the mentioned fields, of the broader
computer science, applied mathematics and computational science fields.

In the shorter term, the objective of this workshop is to enable and retarget
core algorithmic building blocks that leverage cutting-edge data-flow, task and
data-parallel runtimes, and gradually promote the integration of performance,
energy and other execution properties that an algorithm should embody in order
to fully exploit future hardware and software computing infrastructure.

We welcome ongoing and preliminary work, experience reports showing a negative
result or a gap between the two communities. In general, PMAW topics lie
between fields of domain scientists and CLR experts. For instance, domain
experts who are attempting to map their application to some specific platform
or runtime, as well as CLR experts wishing to identify and learn about strong
and impactful applications and benchmarks suitable for some new software
technology.

All papers must be original and not simultaneously submitted to another journal
or conference. The following is a non-exhaustive list of topics of interest:

- Implementation of algorithms using data-flow models and runtimes
- Domain specific languages, compilers and tools for data-flow, data and task parallelism
- New parallel runtime features that facilitate algorithmic description
- Rethinking of classical algorithms that incorporate parallelism, energy and
  other performance properties
- Communication minimization schemes
- Network aware computing
- Locality and Communication abstractions for algorithmic specification
- Orchestrating runtimes and heterogeneous runtime scheduling
- Experiences in porting or implementing scientific frameworks over one or more
  programming models
- A negative result demonstrating general poor support for some application or
  class of computation and potential solutions or workaround
- Application and runtime demos

[Important Dates]

Paper submission start: November 6, 2017
Abstract due: February 9, 2018
Paper submission due : February 16, 2018
Notification of acceptance : April 2, 2018
Camera ready papers: April 23, 2018
Workshop date: May 25, 2018


[Submission]

Please submit your paper here: https://easychair.org/conferences/?conf=pmaw18
Papers must use the ACM standard LATEX or Word templates.  As this workshop
encourages works-in-progress, papers should be 5-7 pages in length, including
references and appendices Proceedings

PMAW will not have formal proceedings. However, accepted papers will be posted
online so as to allow authors to re-submit their work to other venues and using
the feedback provided in the workshop.


[More Information]

For more information regarding this workshop, please visit:

    https://pmaw.github.io

or contact Martin Kong <mkong at bnl.gov>

Martin Kong
Assistant Scientist
Computational Science Initiative (CSI)
Brookhaven National Laboratory

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.mcs.anl.gov/mailman/private/hpc-announce/attachments/20171219/e6aa6986/attachment.html>