Skip to main content
SpringerLink
Log in

Scheduling Strategies Adopted in Spring: An Overview

  • Chapter
Foundations of Real-Time Computing: Scheduling and Resource Management

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 141))

Abstract

In managing the tasks and resources in a real-time system, there are three phases to consider:

  • allocation - the assignment of the tasks and resources to the appropriate nodes or processors in the system

  • scheduling - ordering the execution of tasks such that their timing constraints are met and the consistency of resources is maintained, and

  • dispatching - executing the tasks in conformance with the scheduler’s decisions.

Whereas a large part of our work deals with scheduling, more recently we have begun to examine allocation and dispatching issues in the context of our scheduling approach. To date, the main results of our work include (i) the adoption and development of guarantee, a notion fundamental to predictable scheduling, (ii) algorithms for the guarantee of dynamically arriving tasks, (iii) an analysis of the quality of the schedules produced by the basic version of our algorithm, (iv) the schemes for reclaiming unused time and resources when tasks complete early, (y) distributed scheduling and meta-level control techniques, and (vi) algorithms for the static allocation and scheduling of safety-critical tasks. These results form the basis for predictable, adaptable, and flexible scheduling support for complex real-time systems.

This work was supported by ONR under contract N00014-85-K-0389, by NSF under grant DCR-8500332, and by a grant from Texas Instruments.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. S. Biyabani, “The Integration of Deadline and Criticalness in Hard Real–Time Scheduling,” Masters Thesis, Univ. of Mass., August 1987.

    Google Scholar 

  2. S. Biyabani, J.A. Stankovic, and K. Ramamritham, “The Integration of Deadline and Criticalness in Hard Real–Time Scheduling,” Proc. Real-Time Systems Symposium, December 1988.

    Google Scholar 

  3. S. Cheng, J.A. Stankovic, and K. Ramamritham, “Dynamic Scheduling of Groups of Tasks with Precedence Constraints in Distributed Hard Real-Time Systems,” Real-Time Systems Symposium,December 1986.

    Google Scholar 

  4. S. Cheng, “Dynamic Scheduling Algorithms for Distributed Hard Real-Time Systems,” Ph.D. Thesis, University of Massachusetts, May 1987.

    Google Scholar 

  5. L.D.Molesky, K. Ramamritham,C. Shen,J.A.Stankovic, and G. Zlokapa. “Implementing a Predictable Real-time Multiprocessor Kernel – the Spring Kernel”, 7th IEEE Workshop on Real-time Operating Systems and Software, May 1990.

    Google Scholar 

  6. A.K. Mok “Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment”, Ph.D. Dissertation, Department of Electrical Engineering and Computer Science, MIT Cambridge, Mass.,May 1983.

    Google Scholar 

  7. K.Ramamritham and J.A. Stankovic, “Dynamic Task Scheduling in Distributed Hard Real-Time Systems,” IEEE Software, 1(3), 1984.

    Google Scholar 

  8. K. Ramamritham, J. Stankovic, W. Zhao, “Meta-Level Control in Distributed Real-Time Systems,” Intl. Conference on Distributed Computing Systems, September 1987.

    Google Scholar 

  9. K. Ramamritham, J. Stankovic, P. Shiah, “0(n) Scheduling Algorithms for Real-Time Multiprocessor Systems,” International Conference on Parallel Processing Systems, August 1989.

    Google Scholar 

  10. K. Ramamritham, J. Stankovic, and W. Zhao, “Distributed Scheduling of Tasks With Deadlines and Resource Requirements,” IEEE Transactions on Computers, Vol. 38, No. 8, August 1989, pp. 1110–1123.

    Article  Google Scholar 

  11. K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems,” IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 2, April 1990, pp. 184–194.

    Article  Google Scholar 

  12. K. Ramamritham, “Scheduling Complex Periodic Tasks”, Intl. Conference on Distributed Computing Systems, June 1990.

    Google Scholar 

  13. K. Ramamritham and J. M. Adan, “Load Balancing During the Static Allocation and Scheduling of Complex Periodic Tasks”, COINS Technical Report, October 1990.

    Google Scholar 

  14. L. Sha, R. Rajkumar, J. Lehoczky and K. Ramamritham, “Mode Change Protocols for Priority-Driven Preemptive Scheduling”, Real-Time Systems, pp. 243–264, Vol. 1, No. 3, December 1989.

    Article  Google Scholar 

  15. C. Shen, K. Ramamritham, and J. Stankovic, Resource Reclaiming in Real-Time, Proc Real-Time System Symposium, December 1990.

    Google Scholar 

  16. P. Shiah, “Real-Time Multiprocessor Scheduling Algorithms,” MS Thesis, Univ. of Mass., January 1989.

    Google Scholar 

  17. J.A. Stankovic, “Stability and Distributed Scheduling Algorithms,” IEEE Trans. on Software Engineering, Vol. SE-11, No. 10, October 1985.

    Google Scholar 

  18. J.A. Stankovic, K. Ramamritham, and S. Cheng, “Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard Real-Time Systems,” IEEE Transactions on Computers,December 1985, pp. 1130–1143.

    Google Scholar 

  19. J. A. Stankovic, “Misconceptions About Real-Time Computing,” IEEE Computer, October 1988.

    Google Scholar 

  20. J. A. Stankovic and K. Ramamritham, Hard Real-Time Systems, Tutorial Text, IEEE Press, 1988.

    Google Scholar 

  21. J.A. Stankovic, “Decentralized Decision Making for Task Allocation in a Hard Real-Time System” IEEE Transactions on Computers, March 1989.

    Google Scholar 

  22. J. A. Stankovic and K. Ramamritham, “The Spring Kernel: A New Paradigm for Real–Time Systems,” IEEE Software, May 1992. pp. 54–71.

    Google Scholar 

  23. J.D. Ullman, “Polynomial Complete Scheduling Problems”, Operating System Review, Vol. 7, No. 4, October. 1973.

    Article  Google Scholar 

  24. J.D. Ullman, “NP-Complete Scheduling Problems”, Journal of Computer and System Science, October. 1975.

    Google Scholar 

  25. F. Wang, K. Ramamritham, and J.A. Stankovic, “Bounds on the Schedule Length for Some Heuristic Scheduling Algorithms for Hard Real-time Tasks”, submitted for publication, September 1990.

    Google Scholar 

  26. W. Zhao, “A Heuristic Approach to Scheduling with Resource Requirements in Distributed Systems,” Ph.D. Thesis, February 1986.

    Google Scholar 

  27. W. Zhao, K. Ramamritham and J. A. Stankovic, “Preemptive Scheduling under Time and Resource Constraints,” IEEE Trans. on Computers, August 1987, pp. 949–960.

    Google Scholar 

  28. W. Zhao, K. Ramamritham and J. A. Stankovic, “Scheduling Tasks with Resource Requirements in Hard Real-Time Systems,” IEEE Trans. on Software Engineering, SE-12(5), May 1987.

    Google Scholar 

  29. W. Zhao and K. Ramamritham, “Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints,” Journal of Systems and Software, Vol 7, 1987, pp. 195205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Massachusetts, Amherst, MA, 01003, USA

    Krithi Ramamritham & John A. Stankovic

Authors
  1. Krithi Ramamritham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John A. Stankovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Office of Naval Research, USA

    André M. van Tilborg  & Gary M. Koob  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ramamritham, K., Stankovic, J.A. (1991). Scheduling Strategies Adopted in Spring: An Overview. In: van Tilborg, A.M., Koob, G.M. (eds) Foundations of Real-Time Computing: Scheduling and Resource Management. The Springer International Series in Engineering and Computer Science, vol 141. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3956-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3956-8_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6766-6

  • Online ISBN: 978-1-4615-3956-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation