Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

  • Sanjay Baruah
  • Nathan Fisher
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4904)

Abstract

Fixed Task Priority (FTP) scheduling algorithms are priority-driven scheduling algorithms in which all jobs generated by each recurrent task are restricted to have the same priority. The multiprocessor FTP scheduling of sporadic task systems is studied in this paper. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a processor speedup bound.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andersson, B., Baruah, S., Jansson, J.: Static-priority scheduling on multiprocessors. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 193–202. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
  2. 2.
    Baker, T.: Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 120–129. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar
  3. 3.
    Baker, T., Baruah, S.: Schedulability analysis of multiprocessor sporadic task systems. In: Son, S.H., Lee, I., Leung, J.Y.-T. (eds.) Handbook of Real-Time and Embedded Systems, Chapman Hall/ CRC Press (2007)Google Scholar
  4. 4.
    Baker, T.P.: An analysis of fixed-priority schedulability on a multiprocessor. Real-Time Systems: The International Journal of Time-Critical Computing 32(1-2), 49–71 (2006)MATHCrossRefGoogle Scholar
  5. 5.
    Baker, T.P., Fisher, N., Baruah, S.: Algorithms for determining the load of a sporadic task system. Tech. Rep. TR-051201, Department of Computer Science, Florida State University (2005)Google Scholar
  6. 6.
    Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, pp. 182–190. IEEE Computer Society Press, Los Alamitos (1990)CrossRefGoogle Scholar
  7. 7.
    Bertogna, M., Cirinei, M., Lipari, G.: New schedulability tests for real-time tasks sets scheduled by deadline monotonic on multiprocessors. In: Proceedings of the 9th International Conference on Principles of Distributed Systems, Pisa, Italy, December 2005, IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  8. 8.
    Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, 2nd edn. (2005)Google Scholar
  9. 9.
    Dertouzos, M.: Control robotics: The procedural control of physical processors. In: Proceedings of the IFIP Congress, pp. 807–813 (1974)Google Scholar
  10. 10.
    Fisher, N., Baker, T., Baruah, S.: Algorithms for determining the demand-based load of a sporadic task system. In: Proceedings of the International Conference on Real-time Computing Systems and Applications, Sydney, Australia, August 2006, IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  11. 11.
    Fisher, N., Baruah, S.: Global static-priority scheduling of sporadic task systems on multiprocessor platforms. In: Proceeding of the IASTED International Conference on Parallel and Distributed Computing and Systems, Dallas, TX, November 2006 (2006)Google Scholar
  12. 12.
    Klein, M., Ralya, T., Pollak, B., Obenza, R., Harbour, M.G.: A Practitioner’s Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston (1993)Google Scholar
  13. 13.
    Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237–250 (1982)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Mok, A.K.: Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Available as Technical Report No. MIT/LCS/TR-297 (1983)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sanjay Baruah
    • 1
  • Nathan Fisher
    • 2
  1. 1.The University of North Carolina at Chapel Hill 
  2. 2.Wayne State University 

Personalised recommendations