Acta Informatica

, Volume 28, Issue 8, pp 755–775 | Cite as

Greed in resource scheduling

  • Donald W. Gillies
  • Jane W. -S. Liu
Article

Abstract

We examine the worst-case performance of a class of heuristic scheduling algorithms commonly referred to as priority-driven or list-scheduling algorithms. It is well known that these algorithms have anomalous, unpredictable performance when used to schedule nonpreemptive tasks with precedence constraints. We present a general method for deriving the worst-case performance of these algorithms. This method is easy to use, yet powerful enough to yield tight performance bounds for many classes of scheduling problems. We demonstrate the method for several problems to show it has wide applicability. We also present several task systems for which list-scheduling algorithms exhibit unavoidable worst-case performance and discuss the general characteristics of these task systems. These task systems are sometimes overlooked in simulation studies; consequently, the results of these studies may be overly optimistic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biyabani, S.R., Stankovic, J.A., Ramamritham, K.: The integration of deadline and criticalness in hard real-time scheduling. Proc. IEEE Real Time Systems Symposium8, 152–160 (1988)Google Scholar
  2. 2.
    Brown, D.J.: An improved BL lower bound. Info. Proc. Lett.11 (1), 37–39 (1980)Google Scholar
  3. 3.
    Coffman, E.G. (ed.): Computer and job shop scheduling theory. New York: Wiley 1976Google Scholar
  4. 4.
    Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for leveloriented two-dimensional packing algorithms. SIAM J. Comput.9, 808–826 (1980)Google Scholar
  5. 5.
    Gillies, D.W.: Greed in resource scheduling. M.S. Thesis, University of Illinois at Urbana-Champaign (1990)Google Scholar
  6. 6.
    Gillies, D.W., Liu, J.W.S.: Greed in resource scheduling. Proc. IEEE Real-Time Systems Symposium10, 285–294 (1989)Google Scholar
  7. 7.
    Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math.17(2), 416–429 (1969)Google Scholar
  8. 8.
    Kunde, M.: Nonpreemptive LP-scheduling on homogeneous multiprocessor systems. SIAM J. Comput.10(1), 151–173 (1981)Google Scholar
  9. 9.
    Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. Amsterdam: Centre for Mathematics and Computer Science 1989Google Scholar
  10. 10.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM20, 46–61 (1973)Google Scholar
  11. 11.
    Liu, J.W.S., Liu, C.L.: Peformance analysis of multiprocessor systems containing functionally dedicated processors. Acta Inf.10, 95–104 (1978)Google Scholar
  12. 12.
    Liu, J.W.S., Liu, C.L.: Bounds on scheduling algorithms for heterogeneous computing systems. Department of Computer Science, University of Illinois at Urbana-Champaign, Technical Report UIUCDCS-R-74-632 1974Google Scholar
  13. 13.
    Lloyd, E.L.: Concurrent task systems. Oper. Res.29, 189–201 (1981)Google Scholar
  14. 14.
    Lloyd, E.L.: List scheduling bounds for UET systems with resources. Inf. Process. Lett.10(1), 28–31 (1980)Google Scholar
  15. 15.
    Palem, K.V., Simons, B.B.: Scheduling time-critical instructions on RISC machines. ACM Symposium on Principles of Programming Languages17, 270–280 (1990)Google Scholar
  16. 16.
    Sleator, D.D.: A 2.5 times optimal algorithm for packing in two dimensions. Inf. Process. Lett.10(1), 37–40 (1980)Google Scholar
  17. 17.
    Strang, G.: Linear algebra with applications. New York: Academic Press 1980Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Donald W. Gillies
    • 1
  • Jane W. -S. Liu
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations