Adaptive online scheduling of tasks with anytime property on heterogeneous resources
Istv\'an M\'odos, P\v{r}emysl \v{S}\r{u}cha, Roman V\'aclav\'ik, Jan, Smejkal, Zden\v{e}k Hanz\'alek

TL;DR
This paper presents an adaptive online scheduling algorithm for tasks with anytime properties on heterogeneous resources, balancing response time and solution quality through dynamic quality adjustments and estimations.
Contribution
It introduces a novel scheduling approach combining traditional methods with quality control heuristics and a procedure for estimating processing-time-to-quality relationships.
Findings
Effective handling of server overload in client-server applications.
Improved scheduling performance demonstrated on personnel rostering problem.
Two heuristics for setting task quality levels show promising results.
Abstract
An acceptable response time of a server is an important aspect in many client-server applications; this is evident in situations in which the server is overloaded by many computationally intensive requests. In this work, we consider that the requests, or in this case tasks, generated by the clients are instances of optimization problems solved by anytime algorithms, i.e. the quality of the solution increases with the processing time of a task. These tasks are submitted to the server which schedules them to the available computational resources where the tasks are processed. To tackle the overload problem, we propose a scheduling algorithm which combines traditional scheduling approaches with a quality control heuristic which adjusts the requested quality of the solutions and thus changes the processing time of the tasks. Two efficient quality control heuristics are introduced: the first…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
