Abstract
We consider the following scheduling problem: Given a set of unit-length jobs characterized by release times, deadlines and weights an algorithm must pick at most one job for each unit of time with the goal of maximizing the total weight of the chosen jobs. An on-line algorithm is an algorithm which has no information about a job before its release time. In the basic version of this problem it is known that any on-line algorithm is outperformed by an optimal off-line algorithm by a factor of \({{1+\sqrt{5}}\over{2}}-\varepsilon\) on some instance. In this paper we examine the effect of increasing the on-line algorithm’s speed – that is the number of jobs chosen for each unit of time – and show that no speedup can fully compensate for the lack of complete information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pp. 520–529 (2001)
Hajek, B.: On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of 2001 Conference on Information Sciences and Systems (CISS), pp. 434–438 (2001)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Improved online algorithms for buffer management in qoS switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 204–215. Springer, Heidelberg (2004)
Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 209–218 (2007)
Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 199–208 (2007)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of ACM 47(4), 617–643 (2000)
Kim, J.-H.: Optimal buffer management via resource augmentation. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 618–628. Springer, Heidelberg (2004)
Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 801–802 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeżabek, J. (2009). Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95891-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-95891-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95890-1
Online ISBN: 978-3-540-95891-8
eBook Packages: Computer ScienceComputer Science (R0)