Tianming Zhao
Albert Y. Zomaya
ABSTRACT
We consider the problem of non-clairvoyant scheduling on single machine to minimize the total flow time with job size predictions. The existing algorithm achieves 2-consistency to predictions, but no algorithm can simultaneously attain bounded robustness. This work finds a sufficient condition for any algorithm to achieve optimal O(P)-robustness, where P is the maximum ratio of any two job sizes. We give the first algorithm that achieves optimal robustness up to a constant multiplicative factor and optimal consistency using this condition. Finally, for addressing small prediction errors, we present an algorithm that we conjecture to achieve the optimal O(η^2) competitive ratio, where η is the prediction error. Proving the claimed bound is our ongoing work.
- Yossi Azar, Stefano Leonardi, and Noam Touitou. 2021 a. Distortion-oblivious algorithms for minimizing flow time. https://arxiv.org/abs/2109.08424Google Scholar
- Yossi Azar, Stefano Leonardi, and Noam Touitou. 2021 b. Flow Time Scheduling with Uncertain Processing Time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2021). Association for Computing Machinery, New York, NY, USA, 1070--1080.Google ScholarDigital Library
- Allan Borodin and Ran El-Yaniv. 1998. Online Computation and Competitive Analysis .Cambridge University Press, USA.Google ScholarDigital Library
- R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G.Rinnooy Kan. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In Discrete Optimization II , , P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol. 5. Elsevier, 287--326.Google Scholar
- Rajeev Motwani, S. Phillips, and Eric Torng. 1993. Non-clairvoyant scheduling. Theor. Comput. Sci. , Vol. 130 (1993), 17--47.Google ScholarDigital Library
- Manish Purohit, Zoya Svitkina, and Ravi Kumar. 2018. Improving Online Algorithms via ML Predictions. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc.Google Scholar
Index Terms
- Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with Predictions
Recommendations
Flow time scheduling with uncertain processing time
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingWe consider the problem of online scheduling on a single machine in order to minimize weighted flow time. The existing algorithms for this problem (STOC ’01, SODA ’03, FOCS ’18) all require exact knowledge of the processing time of each job. This ...
SRPT optimally utilizes faster machines to minimize flow time
We analyze the shortest remaining processing time (SRPT) algorithm with respect to the problem of scheduling n jobs with release times on m identical machines to minimize total flow time. It is known that SRPT is optimal if m = 1 but that SRPT has a ...
Brief Announcement: A QPTAS for Non-preemptive Speed-scaling
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesModern processors typically allow dynamic speed-scaling offering an effective trade-off between high throughput and energy efficiency. In a classical model, a processor/machine runs at speed s when consuming power sα where α >1 is a constant. Yao et al. ...
Comments