Skip to main content
SpringerLink
Log in

An Analysis of Partially Clairvoyant Scheduling

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

Real-time scheduling problems confront two issues not addressed by traditional scheduling models, viz., parameter variability and the existence of complex relationships constraining the executions of jobs. Accordingly, modeling becomes crucial in the specification of scheduling problems in such systems. In this paper, we analyze scheduling algorithms in Partially Clairvoyant Real-time scheduling systems and present a new dual-based algorithm for the feasibility problem in the case of strict relative constraints. We also study the problem of online dispatching in Partially Clairvoyant systems and show that the complexity of dispatching is logarithmically related to the complexity of the schedulability problem.

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

  1. Choi, S.: Dynamic time-based scheduling for hard real-time systems, PhD thesis, University of Maryland, College Park, June 1997.

    Google Scholar 

  2. Choi, S.: Dynamic time-based scheduling for hard real-time systems, J. Real-Time Systems, 2000.

  3. Cormen, T. H., Leiserson, C. E. and Rivest, R. L.: Introduction to Algorithms, 6th edn, MIT Press and McGraw-Hill, 1992.

  4. Dantzig, G. B. and Eaves, B. C.: Fourier- Motzkin elimination and its dual, J. Combin. Theory (A) 14 (1973), 288–297.

    Google Scholar 

  5. Damm, A., Reisinger, J., Schwabl, W. and Kopetz, H.: The real-time operating system of MARS, ACM Special Interest Group on Operating Systems 23(3) (1989), 141–157.

    Google Scholar 

  6. Gerber, R., Pugh, W. and Saksena M.: Parametric dispatching of hard real-time tasks, IEEE Trans. Comput., 1995.

  7. Huynh, Joskowicz, Lassezand Lassez:Reasoning about linear constraints using parametric queries, FSTTCS: Foundations of Software Technology and Theoretical Computer Science 10 (1990).

  8. Han, C. C. and Lin, K. J.: Scheduling distance-constrained real-time tasks, In: Proceedings, IEEE Real-time Systems Symposium, Phoenix, Arizona, December 1992, pp. 300–308.

  9. Han, C. C. and Lin, K. J.: Scheduling real-time computations with separation constraints, Inform. Process. Lett. 12 (1992), 61–66.

    Google Scholar 

  10. Levi, S. T., Tripathi, S. K., Carson, S. D. and Agrawala, A. K.: The Maruti hard real-time operating system, ACM Special Interest Group on Operating Systems 23(3) (1989), 90–106.

    Google Scholar 

  11. Mosse, D., Agrawala, A. K. and Tripathi, S. K.: Maruti a hard real-time operating system, In: Second IEEE Workshop on Experimental Distributed Systems, IEEE, 1990, pp. 29–34.

  12. Nemhauser, G. L. and Wolsey, L. A.: Integer and Combinatorial Optimization, Wiley, New York, 1999.

    Google Scholar 

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

    Google Scholar 

  14. Saksena, M.: TIParametric scheduling in hard real-time systems, PhD thesis, University of Maryland, College Park, June 1994.

    Google Scholar 

  15. Schrijver, A.: Theory of Linear and Integer Programming, Wiley, New York, 1987.

    Google Scholar 

  16. Subramani, K. and Kovalchick, L.: Contraction versus relaxation: A comparison of two approaches for the negative cost cycle detection problem, In: P. M. A. Sloot et al. (eds), Proceedings of the 3rd International Conference on Computational Science (ICCS), Lecture Notes in Comput. Sci., Springer-Verlag, June 2003.

  17. Subramani, K.: An analysis of zero-clairvoyant scheduling, In: J.-P. Katoen and P. Stevens (eds), Proceedings of the 8th International Conference on Tools and Algorithms for the Construction of Systems (TACAS), Lecture Notes in Comput. Sci. 2280, Springer-Verlag, April 2002, pp. 98–112.

  18. 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), Lecture Notes in Comput. Sci. 2540, Springer-Verlag, November 2002, pp. 195–207.

  19. Chandru, V. and Rao, M. R.: Linear programming, In: Algorithms and Theory of Computation Handbook, CRC Press, 1999.

  20. Wolfe, V., Davidson, S. and Lee, I.: Rtc: Language support for real-time concurrency, In: Proceedings IEEE Real-Time Systems Symposium, December 1991, pp. 43–52.

Download references

Author information

Authors and Affiliations

  1. LCSEE, West Virginia University, Morgantown, WV, 26506, U.S.A

    K. Subramani

Authors
  1. K. Subramani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Subramani, K. An Analysis of Partially Clairvoyant Scheduling. Journal of Mathematical Modelling and Algorithms 2, 97–119 (2003). https://doi.org/10.1023/A:1024930227883

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024930227883

Search

Navigation