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:20260522T150122Z
LOCATION:D173
DTSTART;TZID=America/Chicago:20181112T153000
DTEND;TZID=America/Chicago:20181112T155000
UID:submissions.supercomputing.org_SC18_sess175_ws_opensu102@linklings.com
SUMMARY:Driving Asynchronous Distributed Tasks with Events
DESCRIPTION:Nick Brown (University of Edinburgh)\n\nOpen-source matters, n
 ot just to the current cohort of HPC users, but also to potential new HPC 
 communities, such as machine learning, themselves often rooted in open-sou
 rce. Many of these potential new workloads are, by their very nature, far 
 more asynchronous and unpredictable than traditional HPC codes and open-so
 urce solutions must be found to enable new communities of developers to ea
 sily take advantage of large scale parallel machines. Task-based models ha
 ve the potential to help here, but many of these either entirely abstract 
 the user from the distributed nature of their code, placing emphasis on th
 e runtime to make important decisions concerning scheduling and locality, 
 or require the programmer to explicitly combine their task-based code with
  a distributed memory technology such as MPI, which adds considerable comp
 lexity. In this paper we describe a new approach where the programmer stil
 l splits their code up into distinct tasks, but is explicitly aware of the
  distributed nature of the machine and drives interactions between tasks v
 ia events. This provides the best of both worlds; the programmer is able t
 o direct important aspects of parallelism whilst still being abstracted fr
 om the low level mechanism of how this parallelism is achieved. We demonst
 rate our approach via two use-cases, the Graph500 BFS benchmark and in-sit
 u data analytics of MONC, an atmospheric model. For both applications, we 
 demonstrate considerably improved performance at large core counts and the
  result of this work is an approach and open-source library which is readi
 ly applicable to a wide range of codes.\n\nTag: Architectures, Collaborati
 ve Environments, Parallel Programming Languages, Libraries, and Models, Si
 mulation, Workflows\n\nRegistration Category: Workshop Reg Pass\n\nSession
  Chairs: David Donofrio (Tactical Computing Laboratories LLC, Lawrence Ber
 keley National Laboratory (LBNL)); Farzad Fatollahi-Fard (Lawrence Berkele
 y National Laboratory); and John Leidel (Tactical Computing Laboratories L
 LC, Texas Tech University)\n\n
END:VEVENT
END:VCALENDAR