Abstract
We consider an online scheduling problem, motivated by the issues present at the joints of networks using ATM and TCP/IP. Namely, IP packets have to broken down to small ATM cells and sent out before their deadlines, but cells corresponding to different packets can be interwoven. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time r j , has processing time p j , deadline d j and weight w j . A preempted job can be resumed at any time. The goal is to maximize the total weight of all jobs completed on time. Our main results are as follows: we prove that if all jobs have processing time exactly k, the deterministic competitive ratio is between 2.598 and 5, and when the processing times are at most k, the deterministic competitive ratio is Θ(k/logk).
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
Baptiste, P.: An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4), 175–180 (1999)
Baptiste, P., Chrobak, M., Dürr, C., Jawor, W., Vakhania, N.: Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters 32(3), 258–264 (2004)
Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. In: Real-Time Systems Symposium, December 1994, pp. 228–236 (1994)
Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM J. Comput. 27(4), 993–1015 (1998)
Chan, W.-T., Lam, T.W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Proc. 10th International on Computing and Combinatorics Conference, pp. 210–218 (2004)
Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, algorithms and approximability. In: Handbook of Combinatorial Optimization, vol. 3, pp. 21–169. Kluwer Academic Publishers, Dordrecht (1998)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36(6), 1709–1728 (2007)
Englert, M., Westermann, M.: Considering suppressed packets improves buer management in QoS switches. In: Proc. 18th Symp. on Discrete Algorithms (SODA), pp. 209–218. ACM/SIAM (2007)
Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of Conference on Information Sciences and Systems (CISS), pp. 434–438 (2001)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 617–643 (2000)
Kalyanasundaram, B., Pruhs, K.: Maximizing job completions online. Journal of Algorithms 49(1), 63–85 (2003)
Lawler, E.L.: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the “tower of sets” property. Mathl. Comput. Modelling 20(2), 91–106 (1994)
Ting, H.-F.: A near optimal scheduler for on-demand data broadcasts. Theoretical Computer Science 401(1-3), 77–84 (2008)
Vakhania, N.: A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor. In: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications, pp. 158–161 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dürr, C., Jeż, Ł., Nguyen, K.T. (2010). Online Scheduling of Bounded Length Jobs to Maximize Throughput. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-12450-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12449-5
Online ISBN: 978-3-642-12450-1
eBook Packages: Computer ScienceComputer Science (R0)