Advertisement

Maximizing the Throughput of Multiple Machines On-Line

  • Jae-Hoon Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)

Abstract

We study the nonpreemptive online scheduling of jobs with deadlines and weights. The goal of the scheduling algorithm is to maximize the total weight of jobs completed by their deadlines. As a special case, the weights may be given as the processing times of jobs, where the job instance is said to have uniform value density.

Most previous work of nonpreemptively scheduling jobs online concentrates on a single machine and uniform value density. For the single machine, Goldwasser [6] shows a matching upper bound and lower bound of \((2 + \frac{1}{\kappa})\) on the best competitive ratio, where every job can be delayed for at least κ times its processing time before meeting its deadline. This paper is concerned with multiple machines. We provide a \((7 + 3\sqrt{\frac{1}{\kappa}})\)-competitive algorithm defined on multiple machines. Also we consider arbitrary value density, where jobs have arbitrary weights. We derive online scheduling algorithms on a single machine as well as on multiple machines.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wand, F.: On the competitiveness of on-line task real-time task scheduling. Journal of Real-Time Systems 4(2), 124–144 (1992)CrossRefGoogle Scholar
  2. 2.
    Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D.: On-line scheduling in the presence of overload. In: Proc. of the 32nd Annual Symposium on Foundation of Computer Science, pp. 100–110 (1991)Google Scholar
  3. 3.
    DasGupta, B., Palis, M.A.: Online real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling 4, 297–312 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Garay, J.A., Naor, J., Yener, B., Zhao, P.: On-line admission control and packet scheduling with interleaving. In: Proc. of the 21st IEEE INFOCOM (2002)Google Scholar
  5. 5.
    Goldman, S., Parwatikar, J., Suri, S.: On-line scheduling with hard deadlines. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 258–271. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  6. 6.
    Goldwasser, M.H.: Patience is a virtue: The effect of slack on competitiveness for admission control. Journal of Scheduling 6, 183–211 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kim, J.-H., Chwa, K.-Y.: On-line deadline scheduling on multiple resources. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 443–452. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Koo, C.Y., Lam, T.W., Ngan, T.W., To, K.K.: Extra processors versus future information in optimal deadline scheduling. In: Proc. of the 14th ACM Annual Symposium on Parallel Algorithms and Architectures, pp. 755–764 (2002)Google Scholar
  9. 9.
    Koren, G., Shasha, D.: Moca: A multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science 128(1), 75–97 (1994)zbMATHCrossRefGoogle Scholar
  10. 10.
    Koren, G., Shasha, D.: Dover: An optimal on-line scheduling algorithm for overloaded real-time systems. SIAM Journal of Computing 24(2), 318–339 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Lee, J.-H.: On-line deadline scheduling: multiple machines and randomization. In: Proc. of the 15th Annual ACM Symposium on Parallel Algorithms, pp. 19–23 (2003)Google Scholar
  12. 12.
    Lipton, R., Tomkins, A.: Online interval scheduling. In: Proc. of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 302–311 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jae-Hoon Kim
    • 1
  1. 1.Department of Computer EngineeringPusan University of Foreign StudiesBusanKorea

Personalised recommendations