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:20181221T160728Z
LOCATION:D166
DTSTART;TZID=America/Chicago:20181112T154500
DTEND;TZID=America/Chicago:20181112T160000
UID:submissions.supercomputing.org_SC18_sess173_ws_espm101@linklings.com
SUMMARY:Analysis of Explicit vs. Implicit Tasking in OpenMP Using Kripke
DESCRIPTION:Workshop\nAccelerators, Exascale, Parallel Programming Languag
 es, Libraries, and Models, Workshop Reg Pass\n\nAnalysis of Explicit vs. I
 mplicit Tasking in OpenMP Using Kripke\n\nJin, Baskaran\n\nDynamic task-ba
 sed parallelism has become a widely-accepted paradigm in the quest for exa
 scale computing. In this work, we deliver a non-trivial demonstration of t
 he advantages of explicit over implicit tasking in OpenMP 4.5 in terms of 
 both expressiveness and performance. We target the Kripke benchmark, a min
 i-application used to test the performance of discrete particle codes, and
  find that the dependence structure of the core “sweep” kernel is well-sui
 ted for dynamic task-based systems. Our results show that explicit tasking
  delivers a 31.7% and 8.1% speedup over a pure implicit implementation for
  a small and large problem, respectively, while a hybrid variant also unde
 rperforms the explicit variant by 13.1% and 5.8%, respectively.
URL:https://sc18.supercomputing.org/presentation/?id=ws_espm101&sess=sess1
 73
END:VEVENT
END:VCALENDAR