Director of Research (if dissertation) or Advisor (if thesis)
Srikant, Rayadurgam
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
Lyapunov
Control Thoery
Stochastic Systems
Cache
LRU
Least recently used
Markov Chain
TTL
Abstract
Caches are segments of memory that store requested information in a system subject to a set of decision rules, defined as the caching algorithm. One of the most popular caching algorithms is the least recently used algorithm (LRU) due to its simplicity and effectiveness in a multitude of applications. LRU caches operate by storing objects in the order that they were most recently requested. Further, whenever an item is requested that is not currently in the cache, the requested item is placed at the head of the cache, and the least recently requested item is evicted. Many have suggested a tie between the performance of an LRU cache and a time to live (TTL) cache. In this thesis, we present a unique Lyapunov based proof for an asymptotically exact TTL approximation for the steady state distribution of our LRU Markov model. We further present ongoing theoretical extensions to other variants of LRU, as well as simulations that validate our model. We conclude by proposing a variance corrected model to better approximate hit rate over time.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
