Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 20 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 177 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

SkipPredict: When to Invest in Predictions for Scheduling (2402.03564v1)

Published 5 Feb 2024 in cs.LG and cs.DC

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)
  1. [n.d.]. Algorithms with Predictions Paper List. https://algorithms-with-predictions.github.io.
  2. Flow time scheduling with uncertain processing time. In STOC. 1070–1080. https://doi.org/10.1145/3406325.3451023
  3. Distortion-Oblivious Algorithms for Minimizing Flow Time. In ACM-SIAM. 252–274. https://doi.org/10.1137/1.9781611977073.13
  4. Matteo Dell’Amico. 2019. Scheduling with inexact job sizes: The merits of shortest processing time first. arXiv preprint arXiv:1907.04824 (2019).
  5. PSBS: Practical size-based scheduling. IEEE Trans. Comput. 65, 7 (2015), 2199–2212.
  6. Emilia Grass and Kathrin Fischer. 2016. Two-stage stochastic programming in disaster management: A literature survey. Surveys in Operations Research and Management Science 21, 2 (2016), 85–100.
  7. Mor Harchol-Balter. 2013. Performance modeling and design of computer systems: queueing theory in action. Cambridge University Press.
  8. Viacheslav Viktorovich Kolbin. 1977. Stochastic programming. Number 14. Springer Science & Business Media.
  9. Michael Mitzenmacher. 2019. Scheduling with predictions and the price of misprediction. arXiv preprint arXiv:1902.00732 (2019).
  10. Michael Mitzenmacher. 2021. Queues with small advice. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21). SIAM, 1–12.
  11. Michael Mitzenmacher and Sergei Vassilvitskii. 2020. Algorithms with Predictions. In Beyond the Worst-Case Analysis of Algorithms, Tim Roughgarden (Ed.). Cambridge University Press, 646–662. https://doi.org/10.1017/9781108637435.037
  12. Michael Mitzenmacher and Sergei Vassilvitskii. 2022. Algorithms with predictions. Commun. ACM 65, 7 (2022), 33–35. https://doi.org/10.1145/3528087
  13. Scheduling firm real-time applications on the edge with single-bit execution time prediction. In ISORC. 207–213.
  14. Evaluating Dispatching and Scheduling Strategies for Firm Real-Time Jobs in Edge Computing. In IECON. 1–6.
  15. Uniform Bounds for Scheduling with Job Size Estimates. In ITCS. 114:1–114:30. https://doi.org/10.4230/LIPIcs.ITCS.2022.114
  16. Ziv Scully and Mor Harchol-Balter. 2018. SOAP bubbles: Robust scheduling under adversarial noise. In 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 144–154.
  17. David B Shmoys and Chaitanya Swamy. 2004. Stochastic optimization is (almost) as easy as deterministic optimization. In 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 228–237.
  18. Chaitanya Swamy and David B Shmoys. 2006. Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News 37, 1 (2006), 33–46.
  19. Adam Wierman and Misja Nuyens. 2008. Scheduling despite inexact job-size information. In Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. 25–36.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 3 tweets and received 2 likes.

Upgrade to Pro to view all of the tweets about this paper: