Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache

Daniel Berend, Shlomi Dolev, Avinatan Hassidim, Marina Kogan-Sadetsky

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

Abstract

The goal of this paper is to present an efficient realistic metric for evaluating cache scheduling algorithms in multi-user multi-cache environments. In a previous work, the requests sequence was set deliberately by an opponent (offline optimal) algorithm in an extremely unrealistic way, leading to an unlimited competitive ratio and to extremely unreasonable and unrealistic cache management strategies. In this paper, we propose to analyze the performance of cache management in a typical scenario, i.e., we consider all possibilities with their (realistic) distribution. In other words, we analyze the average case and not the worst case of scheduling scenarios. In addition, we present an efficient, according to our novel average case analysis, online heuristic algorithm for cache scheduling. The algorithm is based on machine-learning concepts, it is flexible and easy to implement.

Original languageEnglish
Title of host publicationCyber Security Cryptography and Machine Learning - 4th International Symposium, CSCML 2020, Proceedings
EditorsShlomi Dolev, Gera Weiss, Vladimir Kolesnikov, Sachin Lodha
PublisherSpringer
Pages237-244
Number of pages8
ISBN (Print)9783030497842
DOIs
StatePublished - 1 Jan 2020
Event4th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2020 - Beersheba, Israel
Duration: 2 Jul 20203 Jul 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12161 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2020
Country/TerritoryIsrael
CityBeersheba
Period2/07/203/07/20

Keywords

  • Competitive ratio
  • Concurrent cache
  • Scheduling algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache'. Together they form a unique fingerprint.

Cite this