Skip to main content
SpringerLink
Log in

An Analysis of Totally Clairvoyant Scheduling

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Traditional scheduling models assume that the execution time of a job in a periodic job-set is constant in every instance of its execution. This assumption does not hold in real-time systems wherein job execution time is known to vary. A second feature of traditional models is their lack of expressiveness, in that constraints more complex than precedence constraints (for instance, relative timing constraints) cannot be modeled. Thirdly, the schedulability of a real-time system depends upon the degree of clairvoyance afforded to the dispatcher. In this paper, we shall discuss Totally Clairvoyant Scheduling, as modeled within the E-T-C scheduling framework (Subramani, 2002). We show that this instantiation of the scheduling framework captures the central issues in a real-time flow-shop scheduling problem and devise a polynomial time sequential algorithm for the same. The design of the polynomial time algorithm involves the development of a new technique, which we term Mutable Dynamic Programming. We expect that this technique will find applications in other areas of system design, such as Validation and Software Verification. We also introduce an error-minimizing performance metric called Violation Degree and establish that optimizing this metric in a Totally Clairvoyant Scheduling System is NP-Hard.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Atlas, A. and A. Bestavros, “Design and implementation of statistical rate monotonic scheduling in kurt linux” in Proceedings IEEE Real-Time Systems Symposium, Dec. 1998.

  • Brucker, P., Scheduling Algorithms, 2nd edn., Springer, 1998.

  • Feng, W. C. and J.W.-S. Liu, “Algorithms for scheduling real-time tasks with input error and end-to-end deadlines” IEEE Transactions on Software Engineering, 23(2), 93–105 (1997).

    Google Scholar 

  • Chung, J. Y., J. W. S. Liu, and K. J. Lin, “Scheduling periodic jobs that allow imprecise results” IEEE Transactions on Computers, 19(9), 1156–1173 (1990).

    Google Scholar 

  • Cormen, T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. 2nd edition, MIT Press and McGraw-Hill Book Company, Boston, Massachusetts, 1992.

    Google Scholar 

  • Fiat, A. and G. Woeginger, Online Algorithms: The State of the Art, vol. 1442 of Lecture Notes in Computer Science, Springer-Verlag Inc., New York, NY, USA, 1998.

    Google Scholar 

  • Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman Company, San Francisco, 1979.

    Google Scholar 

  • Gerber, R., W. Pugh, and M. Saksena, “Parametric dispatching of hard real-time tasks” IEEE Transactions on Computers (1995).

  • Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: A survey” Ann. Discrete Mathematics, 5, 287–326 (1979).

    Google Scholar 

  • Hochbaum, D. (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, Masachusetts, 1996.

    Google Scholar 

  • Kalyanasundaram and Pruhs, “Fault-tolerant real-time scheduling” ALGRTHMICA: Algorithmica, 28 (2000).

  • Kalyanasundaram, B. and K. Pruhs, “Speed is as powerful as clairvoyance” in 36th Annual Symposium on Foundations of Computer Science (FOCS’95), Los Alamitos, IEEE Computer Society Press, 1995, pp. 214–223.

    Google Scholar 

  • Leung, J.Y.-T. Research in Real-Time Scheduling, chapter 2, Vol. 2 of Tilborg and Koob (eds.), Foundations of Real-Time Computing-Scheduling and Resource Management, vol. 2, Kluwer Academic Publishers, 1991, pp. 31–62

  • Levi, S. T., S. K. Tripathi, S. D. Carson, and A. K. Agrawala, “The Maruti Hard Real-Time Operating System” ACM Special Interest Group on Operating Systems, 23(3), 90–106 (1989).

    Google Scholar 

  • Liu, J. W. S., K. J. Lin, and S. Natarajan, “Scheduling real-time periodic jobs using imprecise results” in RTSS, pp. 252–260, San Jose, California, 1987.

    Google Scholar 

  • Liu, J. W. S., K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, and W. Zhao, Algorithms for Scheduling Imprecise Computations, chapter 8, Vol. 2 of Tilborg and Koob (eds.), Foundations of Real-Time Computing-Scheduling and Resource Management, vol. 2, Kluwer Academic Publishers, 1991, pp. 203–249.

  • Marlow, W. H., Mathematics for Operations Research, John Wiley & Sons, 1978.

  • Pinedo, M. Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, 1995.

  • Ripoll, I., A. Crespo, and A. Garcia-Fornes, “An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems” IEEE Transactions on Software Engineering, 23(6), 388–399 (1997).

    Google Scholar 

  • Schrijver, A., Theory of Linear and Integer Programming, John Wiley and Sons, New York, 1987.

    Google Scholar 

  • Sgall, J. Online Scheduling, chapter 8, Vol. 1442 of Lecture Notes in Computer Science in Fiat and Woeginger (eds.), Online Algorithms: The State of the Art, Springer-Verlag Inc., New York, NY, USA, 1998, pp. 196–203.

    Google Scholar 

  • Shaked, M. and G. Shanthikumar (eds.), Stochastic Scheduling, Academic Press, San Diego, 1994.

    Google Scholar 

  • Stankovic, J. A. and K. Ramamritham, Hard Real-Time Systems, IEEE Computer Society Press, Los Alamitos, 1988.

    Google Scholar 

  • Stankovic, J. A., M. Spuri, K. Ramamritham, and G. C. Buttazzo (eds.), Deadline Scheduling for Real-Time Systems, Kluwer Academic Publishers, 1998.

  • Subramani, K. “Duality in the parametric polytope and its applications to a scheduling problem” PhD thesis, University of Maryland, College Park, 2000.

  • Subramani, K. “Parametric scheduling for network constraints” in Jie Wang (ed.), Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON), vol. 2108 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 550–560.

  • Subramani, K. “An analysis of zero-clairvoyant scheduling” in Joost-Pieter Katoen and Perdita Stevens (eds.), Proceedings of the 8th International Conference on Tools and Algorithms for the construction of Systems (TACAS), vol. 2280 of Lecture Notes in Computer Science, Springer-Verlag, 2002a, pp. 98–112.

  • Subramani, K. “A specification framework for real-time scheduling” in W. I. Grosky and F. Plasil (eds.), Proceedings of the 29th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), vol. 2540 of Lecture Notes in Computer Science, Springer-Verlag, 2002, pp. 195–207.

  • Tilborg, A. and G. Koob (eds.), Foundations of Real-Time Computing-Scheduling and Resource Management, vol. 2, Kluwer Academic Publishers, 1991.

Download references

Author information

Authors and Affiliations

  1. LCSEE, West Virginia University, Morgantown, WV

    K. Subramani

Authors
  1. K. Subramani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Subramani.

Additional information

This research is supported in part by the Air Force Office of Scientific Research under Grant F49620-02-1-0043.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Subramani, K. An Analysis of Totally Clairvoyant Scheduling. J Sched 8, 113–133 (2005). https://doi.org/10.1007/s10951-005-6367-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-005-6367-2

Keywords

Search

Navigation