Gupta, Anupam ; Kumar, Amit ; Panigrahi, Debmalya (2020) Caching with time windows In: STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, June 22 - 26, 2020, Chicago IL USA.
Full text not available from this repository.
Official URL: http://doi.org/10.1145/3357713.3384277
Related URL: http://dx.doi.org/10.1145/3357713.3384277
Abstract
We consider the (weighted) Paging with Time Windows problem, which is identical to the classical weighted paging problem but where each page request only needs to be served by a given deadline. This problem arises in many practical applications of online caching, such as the deadline I/O scheduler in the Linux kernel and video-on-demand streaming. From a theoretical perspective, this generalizes the caching problem to allow delayed service, a line of work that has recently gained traction in online algorithms (e.g., Emek et al. STOC '16, Azar et al. STOC '17, Azar and Touitou FOCS '19, etc.).
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Association for Computing Machinery. |
| ID Code: | 123497 |
| Deposited On: | 28 Sep 2021 13:03 |
| Last Modified: | 28 Sep 2021 13:03 |
Repository Staff Only: item control page
