Exact Transient Analysis on LRU Cache Startup for Internet of Things

Kin Yeung Wong, Alan Yeung, Ka Cheng Choi, Philip Lei, Chan Tong Lam

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Transient analysis is particularly beneficial to the design of the cache used in Internet of Things as they are turned on and off frequently. Least-Recently-Used (LRU) cache has been studied extensively in the past decades. However, most of the previous studies only focus on stead state analysis. In this paper, an exact transient analysis on LRU cache startup is presented. Starting with an empty content, a LRU cache is filled up with objects. During this transient process, two key performance measures are studied: cache occupancy and cache miss probability. These measures are useful in providing insights such as how long a cache takes to become fully occupied, and how quickly a cache reaches its acceptable cache miss probability. In this study, exact analytical results on these two measures are presented.

Original languageEnglish
Title of host publicationICIT 2021 - Proceedings of the 9th International Conference on Information Technology
Subtitle of host publicationIoT and Smart City
PublisherAssociation for Computing Machinery
Pages310-315
Number of pages6
ISBN (Electronic)9781450384971
DOIs
Publication statusPublished - 22 Dec 2021
Event9th International Conference on Information Technology: IoT and Smart City, ICIT 2021 - Virtual, Online, China
Duration: 22 Dec 202125 Dec 2021

Publication series

NameACM International Conference Proceeding Series

Conference

Conference9th International Conference on Information Technology: IoT and Smart City, ICIT 2021
Country/TerritoryChina
CityVirtual, Online
Period22/12/2125/12/21

Keywords

  • Internet of Things
  • cache performance
  • caching

Fingerprint

Dive into the research topics of 'Exact Transient Analysis on LRU Cache Startup for Internet of Things'. Together they form a unique fingerprint.

Cite this