Skip to main content
SpringerLink
Log in

An Open Framework for Real-Time Scheduling Simulation

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPDPS 2000)

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

Included in the following conference series:

Abstract

Real-time systems seek to guarantee predictable run-time behaviour to ensure that tasks will meet their deadlines. Optimal scheduling decisions, however, easily impose unacceptable run-time costs for many but the most basic scheduling problems, specifically in the context of multiprocessors and distributed systems. Deriving suitable heuristics then usually requires extensive simulations to gain confidence in the chosen approach. In this paper we therefore present Fortissimo, an open framework that facilitates the development of taylor-made real-time scheduling simulators for Multiprocessor systems.

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. N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. STRESS: A simulator for hard real-time systems. Software Practice and Experience, July 1994.

    Google Scholar 

  2. R. Davis and A. Wellings. Dual-priority scheduling. In Proceedings of the Sixteenth Real-Time Systems Symposium, pages 100–109, 1995.

    Google Scholar 

  3. E. Gene. Real-time systems: Spring simulators documentation, 1990. http://www-ccs.cs.umass.edu/spring/internal/spring_sim_docs.html.

  4. M. Gergeleit and H. Streich. Task-pair scheduling with optimistic case execution times—An example for an adaptive real-time system. In Proceedings of the Second Workshop on Object-Oriented Real-Time Dependable Systems (WORDS), February 1996.

    Google Scholar 

  5. T. M. Ghazalie and T. P. Baker. Aperiodic servers in a deadline scheduling environment. Journal of Real-Time Systems, 7(9):31–67, 1995.

    Article  Google Scholar 

  6. E. D. Jensen, C. D. Locke, and H. Tokuda. A time-driven scheduling model for real-time operating systems. In Proceedings of the Sixth IEEE Real-Time Systems Symposium, December 1985.

    Google Scholar 

  7. G. Koren and D. Shasha. Skip-over: Algorithms and complexity for overloaded systems that allow skips. In Proceedings of Sixteenth IEEE Real-Time Systems Symposium. IEEE, 1995.

    Google Scholar 

  8. T. Kramp, M. Adrian, and R. Koster. An open framework for real-time scheduling simulation. SFB 501 Report 01/00, Department of Computer Science, University of Kaiserslautern, Germany, January 2000.

    Book  Google Scholar 

  9. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46–61, 1973.

    Article  MathSciNet  Google Scholar 

  10. J. W. S. Liu, K.-J. Lin, W.-K. Shih, A. C. Yu, J.-Y. Chung, and W. Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, 24(5):58–68, May 1991.

    Article  Google Scholar 

  11. J. W. S. Liu, J. L. Redondo, Z. Deng, T. S. Tia, R. Bettati, A. Silberman, M. Storch, R. Ha, and W. K. Shih. PERTS: A prototyping environment for real-time systems. In Proceedings of the Fourteenth Real-Time Systems Symposium, pages 184–188. IEEE, December 1993.

    Google Scholar 

  12. C. D. Locke. Software architectures for hard real-time applications: Cyclic executives vs. fixed-priority executives. Journal of Real-Time Systems, 4(1):37–53, 1992.

    Article  Google Scholar 

  13. L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronisation. Technical Report CMU-CS-87-181, Computer Science Department, Carnegie Mellon University, 1987.

    Google Scholar 

  14. J. A. Stankovic and K. Ramamritham. The Spring kernel: A new paradigm for hard real-time operating systems. IEEE Software, 8(3):62–72, May 1991.

    Article  Google Scholar 

  15. J. A. Stankovic, M. Spuri, M. Di Natale, and G. Buttazzo. Implications of classical scheduling results for real-time systems. IEEE Computer, 28(6):16–25, June 1995.

    Article  Google Scholar 

  16. A. D. Stoyenko. A schedulability analyzer for Real-time Euclid. In Proceedings of the Eighth Real-Time Systems Symposium, pages 218–227. IEEE, December 1987.

    Google Scholar 

  17. H. Tokuda, J. W. Wendorf, and H.-Y. Wang. Implementation of a time-driven scheduler for real-time operating systems. In Proceedings of the Eighth IEEE Real-Time Systems Symposium, December 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Distributed Systems Group, Dept. of Computer Science, University of Kaiserslautern, P.O.Box 3049, 67653, Kaiserslautern, Germany

    Thorsten Kramp, Matthias Adrian & Rainer Koster

Authors
  1. Thorsten Kramp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Adrian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rainer Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre Universitaire d’Informatique, Université de Genève, 24, rue Général Dufour, CH-1211, Genève 4, Switzerland

    José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kramp, T., Adrian, M., Koster, R. (2000). An Open Framework for Real-Time Scheduling Simulation. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_105

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation