The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms

  • Nathan Fisher
  • Sanjoy Baruah
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3974)

Abstract

We consider the partitioned scheduling of sporadic, hard-real-time tasks on a multiprocessor platform with static-priority scheduling policies. Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task’s relative deadline is equal to its period). We relax the equality constraint on a task’s deadline and consider task systems with constrained deadlines (i.e. relative deadlines are at most periods). In particular, we consider the first-fit decreasing partitioning algorithm. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is unlikely to be optimal. We quantitatively characterize the partitioning algorithm’s worst-case performance in terms of resource augmentation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8(5), 285–292 (1993)CrossRefGoogle Scholar
  2. 2.
    Audsley, N., Burns, A., Wellings, A.: Deadline monotonic scheduling theory and application. Control Engineering Practice 1(1), 71–78 (1993)CrossRefGoogle Scholar
  3. 3.
    Audsley, N.C., Burns, A., Richardson, M.F., Wellings, A.J.: Hard Real-Time Scheduling: The Deadline Monotonic Approach. In: Proceedings 8th IEEE Workshop on Real-Time Operating Systems and Software, Atlanta, pp. 127–132 (May 1991)Google Scholar
  4. 4.
    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
  5. 5.
    Baker, T.P.: An analysis of deadline-monotonic schedulability on a multiprocessor. Tech. Rep. TR-030201, Department of Computer Science, Florida State University (2003)Google Scholar
  6. 6.
    Baker, T.P.: An analysis of EDF schedulability on a multiprocessor. Tech. Rep. TR-030202, Department of Computer Science, Florida State University (2003)Google Scholar
  7. 7.
    Baker, T.P.: Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech. Rep. TR-050601, Department of Computer Science, Florida State University (2005)Google Scholar
  8. 8.
    Baruah, S., Fisher, N.: The partitioned multiprocessor scheduling of sporadic task systems. In: Proceedings of the 26th Real-Time Systems Symposium, Miami, Florida. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Bertogna, M., Cirinei, M., Lipari, G.: Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the Euro Micro Conference on Real-Time Systems, Palma de Mallorca, Balearic Islands, Spain, July 2005, pp. 209–218. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  11. 11.
    Bini, E., Buttazzo, G.: The space of rate monotonic schedulability. In: Proceedings of the 23rd IEEE Real-Time Systems Symposium, Austin, Texas, December 2002, pp. 169–178. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  12. 12.
    Burchard, A., Liebeherr, J., Oh, Y., Son, S.H.: Assigning real-time tasks to homogeneous multiprocessor systems. IEEE Transactions on Computers 44(12), 1429–1442 (1995)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Johnson, D.: Fast algorithms for bin packing. Journal of Computer and Systems Science 8(3), 272–314 (1974)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Johnson, D.S.: Near-optimal Bin Packing Algorithms. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology (1973)Google Scholar
  15. 15.
    Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), October 1995, pp. 214–223. IEEE Computer Society Press, Los Alamitos (1995)Google Scholar
  16. 16.
    Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceedings of the Real-Time Systems Symposium - 1989, Santa Monica, California, USA, December 1989, pp. 166–171. IEEE Computer Society Press, Los Alamitos (1989)Google Scholar
  17. 17.
    Lehoczky, J.P.: Fixed priority scheduling of periodic tasks with arbitrary deadlines. In: IEEE Real-Time Systems Symposium, pp. 201–209 (December 1990)Google Scholar
  18. 18.
    Leung, J., Merrill, M.: A note on the preemptive scheduling of periodic, real-time tasks. Information Processing Letters 11, 115–118 (1980)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237–250 (1982)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Lopez, J.M., Diaz, J.L., Garcia, D.F.: Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Systems: The International Journal of Time-Critical Computing 28(1), 39–68 (2004)CrossRefMATHGoogle Scholar
  22. 22.
    Lopez, J.M., Garcia, M., Diaz, J.L., Garcia, D.F.: Worst-case utilization bound for EDF scheduling in real-time multiprocessor systems. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Stockholm, Sweden, June 2000, pp. 25–34. IEEE Computer Society Press, Los Alamitos (2000)Google Scholar
  23. 23.
    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
  24. 24.
    Oh, D.-I., Baker, T.P.: Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems: The International Journal of Time-Critical Computing 15, 183–192 (1998)CrossRefGoogle Scholar
  25. 25.
    Oh, Y.: The Design and Analysis of Scheduling Algorithms for Real-Time and Fault-Tolerant Computer Systems. PhD thesis, Department of Computer Science, The University of Virginia (1994)Google Scholar
  26. 26.
    Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, May 4-6, 1997, pp. 140–149 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nathan Fisher
    • 1
  • Sanjoy Baruah
    • 1
  1. 1.Department of Computer ScienceThe University of North Carolina at Chapel HillUSA

Personalised recommendations