Skip to main content

Zero-Clairvoyant Scheduling with Inter-period Constraints

  • Conference paper
  • 1159 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3321))

Abstract

This paper introduces two new mathematical modelingparadigms called Periodic Linear Programming and Periodic Quantified Linear Programming. The former is an extension of traditional Linear Programming, whereas the latter extends Quantified Linear Programming. We use these tools to capture the specifications of real-time embedded systems, which are characterized by uncertainty, complex timing constraints and periodicity. The strength of the modeling techniques lies in the ease with which these specifications can be represented and analyzed.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ancilloti, P., Buttazo, G., Di Natale, M., Mok, A.K.: Tracs: A flexible real-time environment for traffic control systems. In: Proceedings IEEE Workshop on Real-Time Applications, May 1993, pp. 50–53 (1993)

    Google Scholar 

  2. Chandru, V., Rao, M.R.: Linear programming. In: Algorithms and Theory of Computation Handbook, CRC Press, Boca Raton (1999)

    Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw-Hill Book Company, Boston/Massachusetts (1992)

    Google Scholar 

  4. Istratescu, V.I.: Introduction to Linear Operator theory. Marcel Dekker Inc., New York (1981)

    MATH  Google Scholar 

  5. Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)

    MATH  Google Scholar 

  6. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)

    Google Scholar 

  7. Subramani, K.: A specification framework for real-time scheduling. In: Grosky, W.I., Plášil, F. (eds.) SOFSEM 2002. LNCS, vol. 2540, pp. 195–207. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Subramani, K.: An analysis of quantified linear programs. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V., et al. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 265–277. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Subramani, K. (2004). Zero-Clairvoyant Scheduling with Inter-period Constraints. In: Maher, M.J. (eds) Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making. ASIAN 2004. Lecture Notes in Computer Science, vol 3321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30502-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30502-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24087-7

  • Online ISBN: 978-3-540-30502-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics