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:20260202T201804Z
LOCATION:265
DTSTART;TZID=America/Chicago:20251116T160000
DTEND;TZID=America/Chicago:20251116T163000
UID:submissions.supercomputing.org_SC25_sess226_ws_ross104@linklings.com
SUMMARY:Assessing Page Reclamation Mechanisms for Linux
DESCRIPTION:Shaochang Liu and Jie Ren (College of William & Mary)\n\nPage 
 reclamation is critical for system performance. However, understanding and
  quantifying inner workings of reclamation policies remains challenging. I
 n this work, we present a comprehensive analysis of Linux's Two-Queue LRU 
 (2QLRU) and Multi-Generational LRU (MGLRU) policies using a lightweight pr
 ofiler that measures decision overhead and reclamation effectiveness. Acro
 ss seven diverse applications under various memory constraints, we quantif
 y how MGLRU achieves better reclamation decisions despite its higher decis
 ion making cost, while its performance benefits diminish under severe memo
 ry constraint. These insights provide guidance for future memory managemen
 t optimizations.\n\nRecording: Livestreamed, Recorded\n\nRegistration Cate
 gory: Technical Program Reg Pass, Workshop Reg Pass\n\nSession Chairs: Kur
 t B. Ferreira (Sandia National Laboratories, University of New Mexico); Ba
 lazs Gerofi (Intel Corporation, RIKEN Center for Computational Science (R-
 CCS)); Torsten Hoefler (ETH Zürich, Microsoft Corporation); and John Lange
  (Oak Ridge National Laboratory (ORNL), University of Pittsburgh)\n\n
END:VEVENT
END:VCALENDAR