Learning-augmented weighted paging
We consider a natural semi-online model for weighted paging, where at any time the algorithm is given predictions, possibly with errors, about the next arrival of each page. The model is inspired by Belady's classic optimal offline algorithm for unweighted paging, and extends the recently studi...
| Autors principals: | , , , , |
|---|---|
| Format: | Conference item |
| Idioma: | English |
| Publicat: |
Society for Industrial and Applied Mathematics
2022
|