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:20250626T233527Z
LOCATION:B302-B305
DTSTART;TZID=America/New_York:20241120T100000
DTEND;TZID=America/New_York:20241120T170000
UID:submissions.supercomputing.org_SC24_sess533_post279@linklings.com
SUMMARY:Memory Disaggregation in Serverless Computing
DESCRIPTION:Joshua Lowe (Illinois Institute of Technology, Rose-Hulman Ins
 titute of Technology) and Nanda Velugoti (Illinois Institute of Technology
 )\n\nIn recent years, the slowing of advancements in memory technology and
  applications’ increasing demand for memory have resulted in high performa
 nce computation becoming bottlenecked by availability of memory. One exist
 ing solution, far memory, involves swapping pages to a remote machine rath
 er than a local disk. Function-as-a-service (FaaS) platforms have also bec
 ome more prevalent, allowing the remote execution of workloads. We first e
 xplore the viability of integrating one FaaS tool, Globus Compute, with a 
 remote swap system for far memory, FastSwap. Then, we investigate the perf
 ormance of the combined system on various workloads to determine which one
 s can incorporate remote memory without excessive overhead cost. We find t
 hat for certain workloads, including breadth-first search and minimum span
 ning tree, it is possible to use up to 30% remote memory without significa
 nt slowdowns. In the poster session, we will present our approach, finding
 s, limitations, and potential generalizations.\n\nRegistration Category: T
 ech Program Reg Pass, Exhibits Reg Pass\n\nSession Chairs: Ayesha Afzal (F
 riedrich-Alexander University, Erlangen-Nuremberg; Erlangen National High 
 Performance Computing Center); Sally Ellingson (University of Kentucky); a
 nd Alan Sussman (University of Maryland)\n\n
END:VEVENT
END:VCALENDAR
