SkipPredict: When to Invest in Predictions for Scheduling
Rana Shahout, Michael Mitzenmacher
Abstract
In light of recent work on scheduling with predicted job sizes, we consider the effect of the cost of predictions in queueing systems, removing the assumption in prior research that predictions are external to the system's resources and/or cost-free. In particular, we introduce a novel approach to utilizing predictions, SkipPredict, designed to address their inherent cost. Rather than uniformly applying predictions to all jobs, we propose a tailored approach that categorizes jobs based on their prediction requirements. To achieve this, we employ one-bit"cheap predictions"to classify jobs as either short or long. SkipPredict prioritizes predicted short jobs over long jobs, and for the latter, SkipPredict applies a second round of more detailed"expensive predictions"to approximate Shortest Remaining Processing Time for these jobs. Our analysis takes into account the cost of prediction. We examine the effect of this cost for two distinct models. In the external cost model, predictions are generated by some external method without impacting job service times but incur a cost. In the server time cost model, predictions themselves require server processing time, and are scheduled on the same server as the jobs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on3
- Advice Querying under Budget Constraint for Online AlgorithmsZiyad Benomar, Vianney PerchetNeurIPS 2023 · 17 citations
- Distortion-Oblivious Algorithms for Minimizing Flow TimeYossi Azar, Stefano Leonardi, Noam TouitouSODA 2022 · 13 citations
- Flow time scheduling with uncertain processing timeYossi Azar, Stefano Leonardi, Noam TouitouSTOC 2021
Related papers
- On Preemption and Learning in Stochastic SchedulingNadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic et al.ICML 2023 · 5 citations
- Efficient Microsecond-scale Blind Scheduling with Tiny QuantaZhihong Luo, Sam Son, Dev Bali, Emmanuel Amaro et al.ASPLOS 2024 · 8 citations
- Opportunistic Scheduling for Optimal Spot Instance Savings in the CloudNeelkamal Bhuyan, Randeep Bhatia, Murali S. Kodialam, T. V. LakshmanINFOCOM 2026 · 2 citations
- Contract Scheduling With PredictionsSpyros Angelopoulos, Shahin KamaliAAAI 2021 · 24 citations
- Non-clairvoyant Scheduling with Partial PredictionsZiyad Benomar, Vianney PerchetICML 2024 · 11 citations
