Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2001: Computing and Combinatorics pp 550–560Cite as

Parametric Scheduling for Network Constraints

  • Conference paper
  • First Online:

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

Abstract

The problem of parametric scheduling is concerned with checking whether a job-set is parametrically schedulable, subject to a set of imposed constraints. In real-time scheduling, parameterization of the schedule plays an important role in extending the flexibility of the scheduler, particularly in the presence of variable execution times. It has been shown that the existence of parametric schedules can be determined in polynomial time when the constraints are restricted to those that can be represented by a network, unimodular matrix. In this paper, we extend the class of constraints for which parametric schedules can be determined efficiently to include network constraints, such as weighted sum of completion times.

This is a preview of subscription content, 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   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. Eric Allender Personal Communication.

    Google Scholar 

  2. Seonho Choi Dynamic dispatching of cyclic real-time tasks with relative time constraints. JRTS, pages 1–35, 2000.

    Google Scholar 

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

    Google Scholar 

  4. M.A.H. Dempster, J.K. Lenstra, and A.H.G. Rinooy Kan, editors. Deterministic and Stochastic Scheduling. Reidel, Dordrecht, 1982.

    Google Scholar 

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

    Google Scholar 

  6. 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 

  7. D.S. Johnson Personal Communication.

    Google Scholar 

  8. Kenneth Kalmanson An Introduction to Discrete Mathematics and its Applications. Addison-Wesley, 1986.

    Google Scholar 

  9. 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 

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

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  13. Alexander Schrijver Theoryof Linear and Integer Programming. John Wiley and Sons, New York, 1987.

    Google Scholar 

  14. M. Shaked and G. Shanthikumar, editors. Stochastic Scheduling .Academic Press, San Diego,1994.

    Google Scholar 

  15. Robert Shostak Deciding linear inequalities by computing loop residues. Journal of the ACM, 28(4):769–779, October 1981.

    Article  MATH  MathSciNet  Google Scholar 

  16. John A. Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio C.Buttazzo, editors. Deadline Scheduling for eal-Time Systems .Kluwer Academic Publishers,1998.

    Google Scholar 

  17. K. Subramani Dualityin the Parametric Polytope and its Applications to a Scheduling Problem. PhD thesis, University of Maryland, College Park, July 2000.

    Google Scholar 

  18. K. Subramani and A.K. Agrawala A dual interpretation of standard constraints in parametric scheduling. In The Sixth International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, September 2000.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Electrical Engineering, 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

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Massachusetts, One University Avenue, Lowell, MA, 01854, USA

    Jie Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Subramani, K. (2001). Parametric Scheduling for Network Constraints. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-44679-6_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42494-9

  • Online ISBN: 978-3-540-44679-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation