Skip to main content
SpringerLink
Log in

A Dual Interpretation of “Standard Constraints” in Parametric Scheduling

  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 2000)

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

Abstract

Parametric scheduling in real-time systems, in the presence of linear relative constraints between the start and execution times of tasks, is a well-studied problem. Prior research established the existence of polynomial time algorithms for the case when the constraints are restricted to be standard and the execution time vectors belong to an axis-parallel hyper-rectangle. In this paper we present a polynomial time algorithm for the case when the execution time vectors belong to arbitrary convex domains. Our insights into the problem occur primarily as a result of studying the dual polytope of the constraint system.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Azer Bestavros and Victor Fay-Wolfe, editors. Real-Time Database and Information Systems, Research Advances. Kluwer Academic Publishers, 1997.

    Google Scholar 

  2. K. R. Baker and Z. Su. Sequencing with Due-Date and Early Start Times to Minimize Maximum Tardiness. Naval Res. Log. Quart., 21:171–176, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992.

    Google Scholar 

  4. E. G. Coffman. Computer and Job-Shop Scheduling Theory, Ed. Wiley, New York, 1976.

    MATH  Google Scholar 

  5. S. K. Dhall and C. L. Liu. On a real-time scheduling problem. Operations Research, 26(1):127–140, Jan. 1978.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Damm, J. Reisinger, W. Schwabl, and H. Kopetz. The Real-Time Operating System of MARS. ACM Special Interest Group on Operating Systems, 23(3):141–157, July 1989.

    Article  Google Scholar 

  7. R. Gerber, W. Pugh, and M. Saksena. Parametric Dispatching of Hard Real-Time Tasks. IEEE Transactions on Computers, 1995.

    Google Scholar 

  8. Dorit S. Hochbaum and Joseph (Seffi) Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23(6):1179–1192, December 1994.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. B. Hiriart-urruty and C. Lemarechal. Convex Analysis and Minimization Algorithms. Springer-Verlag, 1993.

    Google Scholar 

  10. Y. Koren. Computer Control of Manufacturing Systems. McGraw-Hill, New York, 1983.

    Google Scholar 

  11. S. T. Levi, 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, July 1989.

    Article  Google Scholar 

  12. D. Mosse, Ashok K. Agrawala, and Satish K. Tripathi. Maruti a hard real-time operating system. In Second IEEEWorkshop on Experimental Distributed Systems, pages 29–34. IEEE, 1990.

    Google Scholar 

  13. D. Mosse, Keng-Tai Ko, Ashok K. Agrawala, and Satish K. Tripathi. Maruti: An Environment for Hard Real-Time Applications. In Ashok K. Agrawala, Karen D. Gordon, and Phillip Hwang, editors, Maruti OS, pages 75–85. IOS Press, 1992.

    Google Scholar 

  14. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley&Sons, NewYork, 1988.

    MATH  Google Scholar 

  15. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization. Prentice Hall, 1982.

    Google Scholar 

  16. K. Subramani and A. K. Agrawala. The parametric polytope and its applications to a scheduling problem. Technical Report CS-TR-4116, University of Maryland, College Park, Department of Computer Science, March 2000. Submitted to the 7th International Conference on High Performance Computing ( HIPC ) 2000.

    Google Scholar 

  17. K. Subramani and A. K. Agrawala. The static polytope and its applications to a scheduling problem. 3rd IEEE Workshop on Factory Communications, September 2000.

    Google Scholar 

  18. Manas Saksena. Parametric Scheduling in Hard Real-Time Systems. PhD thesis, University of Maryland, College Park, June 1994.

    Google Scholar 

  19. Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, NewYork, 1987.

    Google Scholar 

  20. M. Saksena, J. da Silva, and A. Agrawala. Design and Implementation of Maruti-II. In Sang Son, editor, Principles of Real-Time Systems. Prentice Hall, 1994. Also available as CS-TR-2845, University of Maryland.

    Google Scholar 

  21. K. Shin and M. Epstein. Intertask communication in an integrated multi-robot system. IEEE Journal of Robotics and Automation, 1987.

    Google Scholar 

  22. K. Srinivasan and P.K. Kulkarni. Cross-coupled control of biaxial feed drive mechanisms. ASME Journal of Dynamic Systems, Measurement and Control, 112:225–232, 1990.

    Article  Google Scholar 

  23. K. Subramani, Bao Trinh, and A. K. Agrawala. Implementation of static and parametric schedulers in maruti. Manuscript in Preparation, March 2000.

    Google Scholar 

  24. M. Tayara, Nandit Soparkar, John Yook, and Dawn Tilbury. Real-time data and coordination control for reconfigurable manufacturing systems. In Azer Bestavros and Victor Fay-Wolfe, editors, Real-Time Database and Information Systems, Research Advances, pages 23–48. Kluwer Academic Publishers, 1997.

    Google Scholar 

  25. Y. Koren. Cross-coupled biaxial computer control for manufacturing systems. ASME Journal of Dynamic Systems, Measurement and Control, 102:265–272, 1980.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV, USA

    K. Subramani

  2. Department of Computer Science, University of Maryland, College Park, MD, USA

    Ashok Agrawala

Authors
  1. K. Subramani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashok Agrawala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tata Research Development and Design Centre, 54B, Hadapsar Industrial Estate, Pune, 411013, India

    Mathai Joseph

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Subramani, K., Agrawala, A. (2000). A Dual Interpretation of “Standard Constraints” in Parametric Scheduling. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45352-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41055-3

  • Online ISBN: 978-3-540-45352-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation