LIPIcs.ESA.2023.97.pdf
- Filesize: 0.73 MB
- 14 pages
Document
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs
Authors
-
Part of:
Volume:
31st Annual European Symposium on Algorithms (ESA 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-08-30
File
Document Identifiers
Acknowledgements
The authors would like to thank Minming Li, Pinyan Lu, and Biaoshuai Tao for many insightful discussions on the research topic of this paper.
Cite AsGet BibTex
Enze Sun, Zonghan Yang, and Yuhao Zhang. Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 97:1-97:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ESA.2023.97
https://doi.org/10.4230/LIPIcs.ESA.2023.97
Abstract
We consider the Online Rent Minimization problem, where online jobs with release times, deadlines, and processing times must be scheduled on machines that can be rented for a fixed length period of T. The objective is to minimize the number of machine rents. This problem generalizes the Online Machine Minimization problem where machines can be rented for an infinite period, and both problems have an asymptotically optimal competitive ratio of O(log(p_max/p_min)) for general processing times, where p_max and p_min are the maximum and minimum processing times respectively. However, for small values of p_max/p_min, a better competitive ratio can be achieved by assuming unit-size jobs. Under this assumption, Devanur et al. (2014) gave an optimal e-competitive algorithm for Online Machine Minimization, and Chen and Zhang (2022) gave a (3e+7) ≈ 15.16-competitive algorithm for Online Rent Minimization. In this paper, we significantly improve the competitive ratio of the Online Rent Minimization problem under unit size to 6, by using a clean oracle-based online algorithm framework.
Subject Classification
ACM Subject Classification
- Theory of computation → Online algorithms
Keywords
- Online Algorithm
- Scheduling
- Machine Minimization
- Rent Minimization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Eric Angel, Evripidis Bampis, Vincent Chau, and Vassilis Zissimopoulos. On the Complexity of Minimizing the Total Calibration Cost. In Mingyu Xiao and Frances Rosamond, editors, Frontiers in Algorithmics, Lecture Notes in Computer Science, pages 1-12, Cham, 2017. Springer International Publishing. URL: https://doi.org/10.1007/978-3-319-59605-1_1.
- Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Speed scaling to manage energy and temperature. J. ACM, 54(1), March 2007. URL: https://doi.org/10.1145/1206035.1206038.
- Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, and Cynthia A. Phillips. Efficient scheduling to minimize calibrations. In Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures, pages 280-287, Montréal Québec Canada, July 2013. ACM. URL: https://doi.org/10.1145/2486159.2486193.
- Lin Chen, Minming Li, Guohui Lin, and Kai Wang. Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement). In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pages 237-239, Phoenix AZ USA, June 2019. ACM. URL: https://doi.org/10.1145/3323165.3323173.
- Zuzhi Chen and Jialin Zhang. Online scheduling of time-critical tasks to minimize the number of calibrations. Theoretical Computer Science, page S0304397522000548, January 2022. URL: https://doi.org/10.1016/j.tcs.2022.01.040.
- J. Chuzhoy, S. Guha, S. Khanna, and J. Naor. Machine Minimization for Scheduling Jobs with Interval Constraints. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 81-90, Rome, Italy, 2004. IEEE. URL: https://doi.org/10.1109/FOCS.2004.38.
- Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, and Peter Widmayer. Scheduling with release times and deadlines on a minimum number of machines. In Jean-Jacques Lévy, Ernst W. Mayr, and John C. Mitchell, editors, Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France, volume 155 of IFIP, pages 209-222. Kluwer/Springer, 2004. URL: https://doi.org/10.1007/1-4020-8141-3_18.
- Nikhil Devanur, Konstantin Makarychev, Debmalya Panigrahi, and Grigory Yaroslavtsev. Online Algorithms for Machine Minimization. arXiv:1403.0486 [cs], March 2014. URL: https://arxiv.org/abs/1403.0486.
-
M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
- Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, and Dorothea Wagner. Competitive design and analysis for machine-minimizing job scheduling problem. In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee, editors, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, volume 7676 of Lecture Notes in Computer Science, pages 75-84. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-35261-4_11.
- Prabhakar Raghavan and Clark D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Comb., 7(4):365-374, 1987. URL: https://doi.org/10.1007/BF02579324.
- Barna Saha. Renting a Cloud. In Anil Seth and Nisheeth K. Vishnoi, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), volume 24 of Leibniz International Proceedings in Informatics (LIPIcs), pages 437-448, Dagstuhl, Germany, 2013. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. ISSN: 1868-8969. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2013.437.
- Guosong Yu and Guochuan Zhang. Scheduling with a minimum number of machines. Oper. Res. Lett., 37(2):97-101, 2009. URL: https://doi.org/10.1016/j.orl.2009.01.008.