1 citations · 1 across the 1 of their papers we have counts for
6 papers
New Tools for Peak Memory Scheduling
Ce Jin, Manish Purohit, Zoya Svitkina +2
We study scheduling of computation graphs to minimize peak memory consumption, an increasingly critical task due to the surge in popularity of large deep-learning models. This prob…
Efficient Caching with Reserves via Marking
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina +2
Online caching is among the most fundamental and well-studied problems in the area of online algorithms. Innovative algorithmic ideas and analysis -- including potential functions…
Caching with Reserves
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina +2
Caching is a crucial component of many computer systems, so naturally it is a well-studied topic in algorithm design. Much of traditional caching research studies cache management…
Scheduling with Communication Delay in Near-Linear Time
Quanquan C. Liu, Manish Purohit, Zoya Svitkina +2
We consider the problem of efficiently scheduling jobs with precedence constraints on a set of identical machines in the presence of a uniform communication delay. Such precedence-…
Learning-Augmented Weighted Paging
Nikhil Bansal, Christian Coester, Ravi Kumar +2
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 mo…
Semi-Online Bipartite Matching
Ravi Kumar, Manish Purohit, Aaron Schild +2
In this paper we introduce the \emph{semi-online} model that generalizes the classical online computational model. The semi-online model postulates that the unknown future has a pr…