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:20230124T171523Z
LOCATION:C1-2-3
DTSTART;TZID=America/Chicago:20221117T083000
DTEND;TZID=America/Chicago:20221117T170000
UID:submissions.supercomputing.org_SC22_sess275_rpost141@linklings.com
SUMMARY:Using Umpire’s Coalescing Heuristics to Improve Memory Performance
DESCRIPTION:Posters, Research Posters\n\nUsing Umpire’s Coalescing Heurist
 ics to Improve Memory Performance\n\nBelcher, Beckingsale, McFadden\n\nMem
 ory management APIs like Umpire were created to solve the memory constrain
 ts for applications running on heterogeneous HPC systems. At Lawrence Live
 rmore National Laboratory (LLNL), many application codes utilize the memor
 y management capabilities of Umpire. This study focuses on one such code, 
 a high explosive equation of state chemistry application from LLNL. This c
 ode uses Umpire’s memory pools in order to allocate all required memory at
  once instead of many times throughout the code. The performance of memory
  pools varies widely and depends upon how the blocks of memory within the 
 pool are managed. We conducted several experiments that tested different s
 trategies to manage allocations within a memory pool in order to study the
  impact on performance. Our experiments demonstrate how this performance v
 aries, from causing an application to run out of memory prematurely to red
 ucing peak memory usage by 64%, depending upon that management strategy.\n
 \nRegistration Category: Tech Program Reg Pass, Exhibits Reg Pass
END:VEVENT
END:VCALENDAR