BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T143140Z
LOCATION:B310
DTSTART;TZID=America/New_York:20241117T114500
DTEND;TZID=America/New_York:20241117T115500
UID:submissions.supercomputing.org_SC24_sess737_ws_ia122@linklings.com
SUMMARY:Enhancing Small Message Aggregation with Directive-Based Deferred 
 Execution
DESCRIPTION:Aaron Welch and Oscar Hernandez (Oak Ridge National Laboratory
  (ORNL)) and Stephen Poole and Wendy Poole (Los Alamos National Laboratory
  (LANL))\n\nThe partitioned global address space (PGAS) model offers one-s
 ided communication operations to efficiently access local and remote data 
 through a distributed shared memory model using point-to-point network ope
 rations.  An extension to the OpenSHMEM PGAS library previously demonstrat
 ed how message aggregation could be applied in a minimally intrusive manne
 r to an application, while still achieving a significant portion of the pe
 rformance possible through manual tuning.  However, its primary deficiency
  was the inability to abstract dependencies between aggregated remote memo
 ry accesses and their subsequent uses, which must be managed explicitly by
  applications.  This undermined its goal of preserving algorithmic intent.
   In this paper, we present a novel directive-based approach for automatic
 ally deferring the execution of arbitrary code that depends on aggregated 
 messages, shifting the concern of their efficient management from the appl
 ication to the implementation.  We demonstrate our approach using two appl
 ications from the bale 3.0 classic suite on the Frontier supercomputer.\n\
 nTag: Graph Algorithms, Heterogeneous Computing, Programming Frameworks an
 d System Software\n\nRegistration Category: Workshop Reg Pass\n\nSession C
 hairs: Michela Becchi (North Carolina State University); John Feo (Pacific
  Northwest National Laboratory (PNNL)); Antonino Tumeo (Pacific Northwest 
 National Laboratory (PNNL)); and Ana Lucia Varbanescu (University of Twent
 e, Netherlands; University of Amsterdam, Netherlands)\n\n
END:VEVENT
END:VCALENDAR
