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 [Sub05]. 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Atlas, A., Bestavros, A.: Design and implementation of statistical rate monotonic scheduling in kurt linux. In: Proceedings IEEE Real-Time Systems Symposium (December 1998)
Choi, S., Agrawala, A.K.: Dynamic dispatching of cyclic real-time tasks with relative timing constraints. Real-Time Systems 19(1), 5–40 (2000)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill Book Company, Boston (1992)
Fiat, A., Woeginger, G.: Online algorithms: the state of the art. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442. Springer, Heidelberg (1998)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Mathematics 5, 287–326 (1979)
Gerber, R., Pugh, W., Saksena, M.: Parametric dispatching of hard real-time tasks. IEEE Trans. Computers 44(3), 471–479 (1995)
Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1996)
Kalyanasundaram, Pruhs: Fault-tolerant real-time scheduling. ALGRTHMICA: Algorithmica 28 (2000)
Levi, S.T., Tripathi, S.K., Carson, S.D., Agrawala, A.K.: The Maruti Hard Real-Time Operating System. ACM Special Interest Group on Operating Systems 23(3), 90–106 (1989)
Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1987)
Subramani, K.: Parametric scheduling for network constraints. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 550–560. Springer, Heidelberg (2001)
Subramani, K.: An analysis of zero-clairvoyant scheduling. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 98–112. Springer, Heidelberg (2002)
Subramani, K.: A comprehensive framework for specifying clairvoyance, constraints and periodicty in real-time scheduling. The Computer Journal 48(3), 259–272 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subramani, K. (2005). Totally Clairvoyant Scheduling with Relative Timing Constraints. In: Emerson, E.A., Namjoshi, K.S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2006. Lecture Notes in Computer Science, vol 3855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11609773_26
Download citation
DOI: https://doi.org/10.1007/11609773_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31139-3
Online ISBN: 978-3-540-31622-0
eBook Packages: Computer ScienceComputer Science (R0)