Advertisement

Scheduling unit-time tasks with limited resources

  • Andrew Chi-Chin Yao
Session 1: Scheduling 1
Part of the Lecture Notes in Computer Science book series (LNCS, volume 24)

Abstract

A set of tasks are to be scheduled on a multiprocessing system with s resources. Each task takes one unit time to complete, and requires certain amounts of resources. The schedule is to be consistent with a prescribed partial order relation on the task, and the total demand for each resource must not exceed a fixed amount at any instant. In this paper we analyze the worst-case behavior of several heuristic scheduling algorithms.

Let ω be the time taken for executing all the tasks according to a priority list, and ω0 be the time required when scheduled in an optimal way. It is shown that, independent of the number of processors, ω/ω0 ≦ sω0/2 + 0(s) for any list. When certain heuristic algorithms are used to prepare the list, a significantly improved upper bound can be derived: ω/ω0 ≦ const. × s + 0(1). Some generalizations are possible to the case when the "unit-time" restriction is removed.

When the partial order relation is empty, the problem becomes a natural generalization of the bin-packing problem. Tighter bounds for this special situation are given.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R.L. Graham, "Bounds on Multiprocessing Anomalies and Related Packing Algorithms," AFIPS Conf. Proc. 40 (1972), pp. 205–217.Google Scholar
  2. [2]
    E.G. Coffman, and R.L. Graham, "Optimal Scheduling for two-processor systems," Acta Informatica 1 No. 3 (1972), pp. 200–213.Google Scholar
  3. [3]
    M. Fujii, T. Kasami, and K. Ninomiya, "Optimal Sequencing of Two Equivalent Processors," SIAM J. of App. Math. 17 No. 3 (1969), pp. 784–789.Google Scholar
  4. [4]
    C.L. Liu, Proc. of 13th SWAT conf. (1972), pp. 155–158.Google Scholar
  5. [5]
    T.C. Hu, "Parallel Scheduling and Assembly Line Problems," Operations Research 9 No. 6 (1961), pp. 841–848.Google Scholar
  6. [6]
    N.F. Chen, and C.L. Liu, "On a Class of Scheduling Algorithms for Multiprocessors Computing Systems, this Proceeding.Google Scholar
  7. [7]
    M.R. Garey, R.L. Graham, and J.D. Ullman, "Worst-Case Analysis of Memory Allocation Algorithms," Conf. Record of ACM Symposium on Theory of Computing (1972).Google Scholar
  8. [8]
    M.R. Garey, and R.L. Graham, "Bounds on Scheduling with Limited Resources," 4th Symp. on Operating System Principles, Oct. 15–17, 1973.Google Scholar
  9. [9]
    J.D. Ullman, "Polynomial Complete Scheduling Problems," 4th Symposium on Operating System Principles, 1973.Google Scholar
  10. [10]
    A.C. Yao, "On Scheduling with Limited Resources," to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Andrew Chi-Chin Yao
    • 1
  1. 1.Department of Computer ScienceUniversity of IllinoisUrbana

Personalised recommendations