Paging with Succinct Predictions

10/06/2022
by   Antonios Antoniadis, et al.
0

Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms – a recent line of research that aims to ameliorate the shortcomings of classical worst-case analysis by giving algorithms access to predictions. Such predictions can typically be generated using a machine learning approach, but they are inherently imperfect. Previous work on learning-augmented paging has investigated predictions on (i) when the current page will be requested again (reoccurrence predictions), (ii) the current state of the cache in an optimal algorithm (state predictions), (iii) all requests until the current page gets requested again, and (iv) the relative order in which pages are requested. We study learning-augmented paging from the new perspective of requiring the least possible amount of predicted information. More specifically, the predictions obtained alongside each page request are limited to one bit only. We consider two natural such setups: (i) discard predictions, in which the predicted bit denotes whether or not it is “safe” to evict this page, and (ii) phase predictions, where the bit denotes whether the current page will be requested in the next phase (for an appropriate partitioning of the input into phases). We develop algorithms for each of the two setups that satisfy all three desirable properties of learning-augmented algorithms – that is, they are consistent, robust and smooth – despite being limited to a one-bit prediction per request. We also present lower bounds establishing that our algorithms are essentially best possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2020

Online Algorithms for Weighted Paging with Predictions

In this paper, we initiate the study of the weighted paging problem with...
research
06/30/2022

Online TSP with Predictions

We initiate the study of online routing problems with predictions, inspi...
research
05/28/2020

Better and Simpler Learning-Augmented Online Caching

Lykouris and Vassilvitskii (ICML 2018) introduce a model of online cachi...
research
07/31/2023

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Algorithms with predictions incorporate machine learning predictions int...
research
11/03/2022

MUSTACHE: Multi-Step-Ahead Predictions for Cache Eviction

In this work, we propose MUSTACHE, a new page cache replacement algorith...
research
07/26/2022

Learning-Augmented Maximum Flow

We propose a framework for speeding up maximum flow computation by using...
research
12/06/2021

A Novel Prediction Setup for Online Speed-Scaling

Given the rapid rise in energy demand by data centers and computing syst...

Please sign up or login with your details

Forgot password? Click here to reset