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:20230124T171526Z
LOCATION:C140-142
DTSTART;TZID=America/Chicago:20221118T094000
DTEND;TZID=America/Chicago:20221118T100000
UID:submissions.supercomputing.org_SC22_sess444_ws_hipar102@linklings.com
SUMMARY:OpenMP's Asynchronous Offloading for Combinatorial Scientific Comp
 utations
DESCRIPTION:Workshop\n\nOpenMP's Asynchronous Offloading for Combinatorial
  Scientific Computations\n\nKale, Thavappiragasam\n\nOpenMP has become the
  de facto standard for shared memory parallel programming. OpenMP provides
  a directive, nowait, to enable asynchronous target offload from host to d
 evice. In this presentation, we identify best practices in using the async
 hronous offload in OpenMP correctly and performantly. Through experimental
  evaluation on Summit and Crusher, we show how we use the nowait clause of
  OpenMP to improve performance of a graph algorithm, Floyd-Warshall, by up
  to 58.24% on Summit and 30.38% on Crusher. Such opportunities suggest the
  need for programmers to use the nowait features of OpenMP with care in or
 der to achieve performance.\n\nSession Format: Recorded\n\nTag: Algorithms
 , Architectures, Compilers, Computational Science, Exascale Computing, Het
 erogeneous Systems, Hierarchical Parallelism, Memory Systems, Parallel Pro
 gramming Languages and Models, Parallel Programming Systems, Resource Mana
 gement and Scheduling\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR