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:20181221T160906Z
LOCATION:D175
DTSTART;TZID=America/Chicago:20181111T090000
DTEND;TZID=America/Chicago:20181111T123000
UID:submissions.supercomputing.org_SC18_sess155@linklings.com
SUMMARY:Fifth Workshop on Accelerator Programming Using Directives (WACCPD
 )
DESCRIPTION:Workshop\nAccelerators, Heterogeneous Systems, Parallel Progra
 mming Languages, Libraries, and Models, Workshop Reg Pass\n\nIntroduction 
 - Fifth Workshop on Accelerator Programming Using Directives (WACCPD)\n\nJ
 uckeland, Chandrasekaran, Wienke\n\nCurrent hardware trends lead to ever m
 ore complex compute node architectures offering multiple, heterogeneous le
 vels of massive parallelism. As a result, the ‘X’ in MPI+X demands more fo
 cus. In order to exploit the maximum available parallelism out of such sys
 tems, we are in dire need of sophisticat...\n\n---------------------\nWork
 shop Morning Break\n\n\n\n---------------------\nSession1: WACCPD Keynote:
  Experiences in Using Directive-Based Programming for Accelerated Computin
 g Architectures\n\nWells\n\nAccelerated computing architectures have grown
  in their application within scientific computing since their introduction
   approximately ten-years ago.  From the earliest days, there has been a f
 ocus on the programmability of these systems.  A variety of desired outcom
 es have driven the development o...\n\n---------------------\nHeterogeneou
 s Programming and Optimization of Gyrokinetic Toroidal Code Using Directiv
 es\n\nZhang\n\nThe latest production version of the fusion particle simula
 tion code, Gyrokinetic Toroidal Code (GTC), has been ported to and optimiz
 ed for the next generation exascale GPU supercomputing platform. Heterogen
 eous programming using directives has been utilized to fuse and thus balan
 ce the continuously...\n\n---------------------\nUsing Compiler Directives
  for Performance Portability in Scientific Computing: Kernels from Molecul
 ar Simulation\n\nSedova, Tillack, Tharrington\n\nAchieving performance por
 tability for high-performance computing (HPC) applications in scientific f
 ields has become an increasingly important initiative due to large differe
 nces in emerging supercomputer architectures. Here we test some key kernel
 s from molecular dynamics (MD) to determine whether t...\n\n--------------
 -------\nOpenMP Target Offloading: Splitting GPU Kernels, Pipelining Commu
 nication and Computation, and Selecting Better Grid Geometries\n\nChikin, 
 Gobran, Amaral\n\nThis paper presents three ideas that focus on improving 
 the execution of high-level parallel code in GPUs. The first addresses pro
 grams that include multiple parallel blocks within a single region of GPU 
 code. A proposed compiler transformation can split such regions into multi
 ple, leading to the la...\n\n---------------------\nOpenACC Routine Direct
 ive Propagation Using Interprocedural Analysis\n\nShivam, Wolfe\n\nAcceler
 ator programming today requires the programmer to specify what data to pla
 ce in device memory, and what code to run on the accelerator device. When 
 programming with OpenACC, directives and clauses are used to tell the comp
 iler what data to copy to and from the device, and what code to compile...
 \n\n---------------------\n5th Workshop on Accelerator Programming Using D
 irectives (WACCPD): Closing Remarks\n\nChandrasekaran, Wienke, Juckeland\n
 \nWACCPD Closing Remarks\n\n---------------------\nSession 2: Porting Scie
 ntific Applications Using Directives\n\nWienke\n\n---------------------\nO
 penACC-Based GPU Parallelization of Plane Sweep Algorithm for Geometric In
 tersection\n\nPaudel, Puri\n\nLine segment intersection is one of the elem
 entary operations in computational geometry.  Complex problems in Geograph
 ic Information Systems (GIS) like finding map overlays or spatial joins us
 ing polygonal data require solving segment intersections. Plane sweep para
 digm is used for finding geometric...\n\n---------------------\nA Case Stu
 dy for Performance Portability Using OpenMP 4.5\n\nGayatri, Yang, Kurth, D
 eslippe\n\nIn recent years, the HPC landscape has shifted away from tradit
 ional CPU based systems to energy efficient architectures, relying on many
 -core CPUs or accelerators to achieve high performance. The goal of perfor
 mance portability is to enable developers to rapidly produce applications 
 which run effic...\n\n---------------------\nSession 3: Using OpenMP\n\nLa
 rkin\n\n---------------------\nSession 4: Using OpenACC\n\nAllen\n
END:VEVENT
END:VCALENDAR