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:20260522T150117Z
LOCATION:D170
DTSTART;TZID=America/Chicago:20181111T161400
DTEND;TZID=America/Chicago:20181111T163000
UID:submissions.supercomputing.org_SC18_sess149_ws_mchpc111@linklings.com
SUMMARY:Heterogeneous Memory and Arena-Based Heap Allocation
DESCRIPTION:Sean Williams (New Mexico Consortium) and Latchesar Ionkov, Mi
 chael Lang, and Jason Lee (Los Alamos National Laboratory)\n\nNonuniform M
 emory Access (NUMA) will likely continue to be the chief abstraction used 
 to expose heterogeneous memory. One major problem with using NUMA in this 
 way is, the assignment of memory to devices, mediated by the hardware and 
 Linux OS, is only resolved to page granularity. That is, pages, not alloca
 tions, are explicitly assigned to memory devices. This is particularly tro
 ublesome if one wants to migrate data between devices:\ since only pages c
 an be migrated, other data allocated on the same pages will be migrated as
  well, and it isn't easy to tell what data will be swept along to the targ
 et device. We propose a solution to this problem based on repurposing aren
 a-based heap management to keep locality among related data structures tha
 t are used together, and discuss our work on such a heap manager.\n\nTag: 
 Memory, NVRAM, Parallel Programming Languages, Libraries, and Models\n\nRe
 gistration Category: Workshop Reg Pass\n\nSession Chairs: Ron Brightwell (
 Sandia National Laboratories); Maya Gokhale (Lawrence Livermore National L
 aboratory (LLNL)); Xian-He Sun (Illinois Institute of Technology); and Yon
 ghong Yan (University of North Carolina, Charlotte)\n\n
END:VEVENT
END:VCALENDAR