BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150115Z
LOCATION:D166
DTSTART;TZID=America/Chicago:20181112T103000
DTEND;TZID=America/Chicago:20181112T110000
UID:submissions.supercomputing.org_SC18_sess173_ws_espm108@linklings.com
SUMMARY:Distributed Memory Futures for Compile-Time, Deterministic-by-Defa
 ult Concurrency in Distributed C++ Applications
DESCRIPTION:Jeremiah Wilke, David Hollman, Cannada Lewis, Aram Markosyan, 
 and Nicolas Morales (Sandia National Laboratories)\n\nFutures are a widely
 -used abstraction for enabling deferred execution in imperative programs. 
 Deferred execution enqueues tasks rather than explicitly blocking and wait
 ing for them to execute. Many task-based programming models with some form
  of deferred execution rely on explicit parallelism that is the responsibi
 lity of the programmer. Deterministic-by-default (implicitly parallel) mod
 els instead use data effects to derive concurrency automatically, alleviat
 ing the burden of concurrency management. Both implicitly and explicitly p
 arallel models are particularly challenging for imperative object-oriented
  programming. Fine-granularity parallelism across member functions or amon
 gst data members may exist, but is often ignored. In this work, we define 
 a general permissions model that leverages the C++ type system and move se
 mantics to define an asynchronous programming model embedded in the C++ ty
 pe system. Although a default distributed memory semantic is provided, the
  concurrent semantics are entirely configurable through C++ constexpr inte
 gers. Correct use of the defined semantic is verified at compile-time, all
 owing deterministic- by-default concurrency to be safely added to applicat
 ions. Here we demonstrate the use of these “extended futures” for distribu
 ted memory asynchronous communication and load balancing. An MPI particle-
 in-cell application is modified with the wrapper class using this task mod
 el, with results presented for a Haswell system up to 64 nodes.\n\nTag: Ac
 celerators, Exascale, Parallel Programming Languages, Libraries, and Model
 s\n\nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Dhabalesw
 ar K. (DK) Panda (The Ohio State University), Karl Schulz (Advanced Micro 
 Devices (AMD) Inc), and Hari Subramoni (The Ohio State University)\n\n
END:VEVENT
END:VCALENDAR