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:20211207T055349Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20211117T083000
DTEND;TZID=America/Chicago:20211117T170000
UID:submissions.supercomputing.org_SC21_sess242_spostu118@linklings.com
SUMMARY:Regulating Traffic in a Crowded Cache:  Overcoming the Container E
 xplosion Problem
DESCRIPTION:ACM Student Research Competition: Graduate Poster, ACM Student
  Research Competition: Undergraduate Poster, Posters\n\nRegulating Traffic
  in a Crowded Cache:  Overcoming the Container Explosion Problem\n\nGao\n\
 nMulti-user interactive computing services, such as Binder, dynamically cr
 eate and deploy software containers to provide customized execution enviro
 nments with required system and language dependencies. Unfortunately, cont
 ainer creation can be slow, making services unresponsive to users, while c
 aching leads to combinatorial explosion in the number of containers due to
  the infinite possible combinations, versions, code changes, and users. We
  analyze 13,946,918 Binder launches and explore caching strategies that co
 nsider various features, including package popularity, version stability, 
 recent use, and install time and size. We show that our methods can reduce
  total storage consumption by 1-3% and creation time by 6-11% when compare
 d with a least recently used strategy.\n\nTag: In-Person Only\n\nRegistrat
 ion Category: Tech Program Reg Pass, Exhibit Hall Only
END:VEVENT
END:VCALENDAR