Performance and Cost-Aware Cache Provisioning
Ridwanul Tanvir, George Kesidis
Abstract
While traditional cache policy evaluations fix capacity - often at 0.1% of the dataset - and measure the resulting hit rate, practical edge-cloud deployments require balancing both storage and computational overhead as billed resources. Consequently, system operators frequently focus on a different objective: determining the minimum cache size needed to satisfy a specific Service-Level Objective (SLO) hit-rate. This paper explores this SLO-centric paradigm by analyzing the minimum capacity and execution time each policy requires to hit a defined target. Additionally, we show that dynamically adjusting the segment ratio in segmented policies based on historical workload patterns enhances efficiency. Through evaluations across real-world and synthetic traces, we present a novel hybrid segmented policy that reduces capacity requirements while keeping processing costs low.
Create a lesson
Related papers
Optimal Scheduling in Generalized Switch in Heavy Traffic
Runhan Xie, Ziv Scully, Rhonda Righter et al.
Discovering Performance Archetypes: Critical-Path-Aware Pattern Analysis and Regression Detection
Kaveh Shahedi, Heng Li, Maxime Lamothe et al.
Strong aggregation of the Markov chains associated with matching models based on the automorphism group of their compatibility graphs
Moyi Yang, Jean-Michel Fourneau
Accelerating Transfer-Learning-Based Autotuning with Predictive LLVM IR Performance Ranking
Md Arafat Hossain, Thomas Randall, Akash Dutta et al.
Learning Metastable Dynamics
Rupak Majumdar, Mahmoud Salamati, Nikhil Singh et al.
Dissecting GPU Utilization for LLM Inference on Nvidia Hopper
Mohammad Siavashi, Gerald Q. Maguire, Dejan Kostic et al.