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:20181221T160727Z
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:Workshop\nMemory, NVRAM, Parallel Programming Languages, Libra
 ries, and Models, Workshop Reg Pass\n\nHeterogeneous Memory and Arena-Base
 d Heap Allocation\n\nWilliams, Ionkov, Lang, Lee\n\nNonuniform Memory Acce
 ss (NUMA) will likely continue to be the chief abstraction used to expose 
 heterogeneous memory. One major problem with using NUMA in this way is, th
 e assignment of memory to devices, mediated by the hardware and Linux OS, 
 is only resolved to page granularity. That is, pages, not allocations, are
  explicitly assigned to memory devices. This is particularly troublesome i
 f one wants to migrate data between devices:\ since only pages can be migr
 ated, 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 target device.
  We propose a solution to this problem based on repurposing arena-based he
 ap management to keep locality among related data structures that are used
  together, and discuss our work on such a heap manager.
URL:https://sc18.supercomputing.org/presentation/?id=ws_mchpc111&sess=sess
 149
END:VEVENT
END:VCALENDAR