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:20211207T055411Z
LOCATION:Online
DTSTART;TZID=America/Chicago:20211119T103000
DTEND;TZID=America/Chicago:20211119T105000
UID:submissions.supercomputing.org_SC21_sess329_ws_pawatm102@linklings.com
SUMMARY:Toward High Productivity and Performance for Irregular Application
 s in Chapel
DESCRIPTION:Workshop\n\nToward High Productivity and Performance for Irreg
 ular Applications in Chapel\n\nRolinger, Craft, Krieger, Sussman\n\nLarge 
 scale irregular applications, such as sparse linear algebra and graph anal
 ytics, exhibit fine-grained memory access patterns and operate on very lar
 ge data sets. The Partitioned Global Address Space (PGAS) model simplifies
  the development of distributed-memory irregular applications, as all the 
 memory in the system is viewed logically as a single shared address space.
  The Chapel programming language provides a PGAS programming model and off
 ers high productivity for irregular application developers, as remote comm
 unication is performed implicitly. However, irregular applications written
  in Chapel often struggle to achieve high performance due to implicit fine
 -grained remote communication. In this work, we explore techniques to brid
 ge the gap between high productivity and high performance for irregular ap
 plications using the Chapel programming language. We present high-level im
 plementations of the Breadth First Search (BFS) and PageRank applications.
  We then describe optimized versions that utilize message aggregation and 
 data replication in ways that could potentially be applied automatically, 
 improving performance by as much as 1,219x for BFS and 22x for PageRank. W
 hen compared to MPI+OpenMP implementations that employ optimizations of th
 e same type as those applied to the Chapel codes, our optimized code is 3.
 7x faster on average for BFS but 1.3x slower for PageRank.\n\nTag: Online 
 Only, Applications, Extreme Scale Computing, Heterogeneous Systems, Parall
 el Programming Languages and Models, Software Engineering\n\nRegistration 
 Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR