Abstract
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a positive fixed size, K, which assists in partial reordering of the input, is available for the storage of at most K unscheduled jobs. We study the effect of using a fixed sized buffer (of an arbitrary size) on the supremum competitive ratio over all numbers of machines (the overall competitive ratio), as well as the effect on the competitive ratio as a function of m.
We find a tight bound on the competitive ratio for any m. This bound is \(\frac 43\) for even values of m and slightly lower for odd values of m. We show that a buffer of size Θ(m) is sufficient to achieve this bound, but using K = o(m) does not reduce the best overall competitive ratio which is known for the case without reordering, \(\frac{e}{e-1}\). We further consider the semi-online variant where jobs arrive sorted by non-increasing processing time requirements. In this case we show that it is possible to achieve a competitive ratio of 1. In addition, we find tight bounds as a function of both K and m.
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.
References
Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Information Processing Letters 51, 219–222 (1994)
Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Operations Research Letters 18, 127–131 (1995); Also in ESA 1994
Dósa, G., Epstein, L.: Online scheduling with a buffer on related machines. Journal of Combinatorial Optimization (2008) (to appear)
Ebenlendr, T., Jawor, W., Sgall, J.: Preemptive online scheduling: Optimal algorithms for all speeds. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 327–339. Springer, Heidelberg (2006)
Ebenlendr, T., Sgall, J.: Semi-online preemptive scheduling: One algorithm for all variants. In: Proc. of the 26th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2009 (to appear, 2009)
Englert, M., Özmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: Proc. 48th Symp. Foundations of Computer Science (FOCS), pp. 603–612 (2008)
Epstein, L.: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. Operations Research Letters 29(2), 93–98 (2001); Also in STACS 2001
Epstein, L., Favrholdt, L.M.: Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Operations Research Letters 30(4), 269–275 (2002)
Epstein, L., Noga, J., Seiden, S.S., Sgall, J., Woeginger, G.J.: Randomized online scheduling on two uniform machines. Journal of Scheduling 4(2), 71–92 (2001)
Epstein, L., Sgall, J.: A lower bound for on-line scheduling on uniformly related machines. Operations Research Letters 26(1), 17–22 (2000)
Horwath, E., Lam, E.C., Sethi, R.: A level algorithm for preemptive scheduling. Journal of the ACM 24, 32–43 (1977)
Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi online algorithms for the partition problem. Operations Research Letters 21, 235–242 (1997)
Li, S., Zhou, Y., Sun, G., Chen, G.: Study on parallel machine scheduling problem with buffer. In: Proc. of the 2nd International Multisymposium on Computer and Computational Sciences (IMSCCS 2007), pp. 278–281 (2007)
Seiden, S.: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science 262(1-2), 437–458 (2001)
Seiden, S., Sgall, J., Woeginger, G.: Semi-online scheduling with decreasing job sizes. Operations Research Letters 27(5), 215–221 (2000)
Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters 63(1), 51–55 (1997)
Sgall, J.: On-line scheduling. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms - The State of the Art, ch. 9, pp. 196–231. Springer, Heidelberg (1998)
Wen, J., Du, D.: Preemptive on-line scheduling for two uniform processors. Operations Research Letters 23, 113–116 (1998)
Zhang, G.: A simple semi on-line algorithm for P2//C max with a buffer. Information Processing Letters 61, 145–148 (1997)
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
Dósa, G., Epstein, L. (2009). Preemptive Online Scheduling with Reordering. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)