BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20190719T085744Z
LOCATION:HG EO Nord
DTSTART;TZID=Europe/Stockholm:20190613T195000
DTEND;TZID=Europe/Stockholm:20190613T215000
UID:submissions.pasc-conference.org_PASC19_sess179_post141@linklings.com
SUMMARY:CSM02 - Adding Inter-Node Communication to a C++ Tasking Fram
 ework for Synchronization-Critical Applications
DESCRIPTION:Poster\n\n\nCSM02 - Adding Inter-Node Communication to a 
 C++ Tasking Framework for Synchronization-Critical Applications\n\nKabadsh
 ow, Innerberger, Beckmann, Morgenstern\n\nIn order to use today's heteroge
 neous hardware efficiently, intra-node and inter-node parallelization is r
 equired. Application developers can choose between fully integrated PGAS a
 pproaches hiding the distributed layout of the memory and MPI+X approaches
  separating shared and distributed memory communication. The first is perf
 ectly suited if the communication overhead of the transferred data is smal
 l compared to the attached computational effort. In case more control over
  the message size and message timing is required, the latter approach prov
 ides better tuning possibilities. However, using message passing directly 
 in the application clutters up the code and mixes the often non-trivial co
 mmunication algorithm with the application algorithm. On this poster, we e
 xplore how to extend our tasking framework, which is used for a synchroniz
 ation-critical Fast Multipole Method (FMM), to support distributed memory 
 communication. The tasking framework is based on C++11 and handles the eff
 icient execution of different computational tasks arising in an FMM workfl
 ow. Tasks are configured at compile-time via template meta-programming and
  mapped to ready-to-execute queues once all dependencies are met. We show 
 how this concept can be extended to communication tasks and provide prelim
 inary results.
END:VEVENT
END:VCALENDAR