Two-Dimensional Priority Scheduling Scheme for Open Real-Time Systems

  • Pengliu Tan
  • Hai Jin
  • Minghu Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3983)


This paper focuses on the scheduling of the tasks with hard, soft and non-real-time timing constraints in open real-time systems. It describes a Two-Dimensional Priority Scheduling (TDPS) scheme which not only sets task priority, but also specifies scheduling policy priority. The execution order of a task is determined by both the task priority and its scheduling policy priority. TDPS also supports separating the scheduling mechanism from the scheduling policy. We also enhance TDPS scheme by introducing the CPU utilization bound to each scheduling policy to simplify the schedulability analysis. TDPS scheme can be used to implement different real time systems with different goals (such as hard, soft or hybrid real-time systems) by adjusting the CPU utilization bound of every scheduling policy in runtime. The paper shows through evaluation that TDPS is more open and efficient than the past open real-time scheduling schemes.


Schedule Policy Schedulability Analysis General Processor Share Ready Queue Schedule Latency 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tanenbaum, A.S., Woodhull, A.S.: Operating Systems Design and Implementation, 2nd edn., p. 93. Prentice Hall, Englewood Cliffs (1997)Google Scholar
  2. 2.
    Liu, C.L., Layland, J.: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM Trans. Networking 1(3), 344–357 (1993)CrossRefGoogle Scholar
  4. 4.
    Demers, A., Keshav, S., Shenker, S.: Analysis and Simulation of a Fair Queuing Algorithm. Journal of Internetworking Research and Experience, 3–26 (October 1990)Google Scholar
  5. 5.
    Bennett, J.C.R., Zhang, H.: WF2Q: Worst-case fair weighted fair queuing. In: Proc. of IEEE INFOCOMM 1996, San Francisco, CA, March 1996, pp. 120–128 (1996)Google Scholar
  6. 6.
    Stoica, I., Zhang, H., Ng, T.S.E.: A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services. In: Proc. of ACM SIGCOMM 1997, Cannes, France (1997)Google Scholar
  7. 7.
    Spuri, M., Buttazzo, G.C.: Efficient aperiodic service under the earliest deadline scheduling. In: Proc. of the 15th IEEE Real-Time Systems Symposium (December 1994)Google Scholar
  8. 8.
    Abeni, L., Buttazzo, G.C.: Integrating multimedia applications in hard real-time systems. In: Proc. of the 19th IEEE Real-Time Systems Symposium (December 1998)Google Scholar
  9. 9.
    Deng, Z., Liu, J.W.-S., Sun, J.: A Scheme for Scheduling Hard Real-Time Applications in Open System Environment. In: Proc. of 9th Euromicro Workshop on Real- Time Systems, June 1997, pp. 191–199 (1997)Google Scholar
  10. 10.
    Kopetz, H.: The Time-Triggered Model of Computation. In: Proc. of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998, pp. 168–177 (1998)Google Scholar
  11. 11.
    Han, C.-C., Lin, K.-J., Hou, C.-J.: Distance-constrained scheduling and its applications to real-time systems. IEEE Trans. Computers 45(7), 814–826 (1996)MATHCrossRefGoogle Scholar
  12. 12.
    Deng, Z., Liu, J.W.-S.: Scheduling Real-Time Applications in Open System Environment. In: Proc. of 18th IEEE Real-Time Systems Symposium, San Francisco, CA (December 1997)Google Scholar
  13. 13.
    Kuo, T.-W., Li, C.-H.: A fixed-priority-driven open environment for real-time applications. In: Proc. of the 20th IEEE Real-Time Systems Symposium, December 1999, pp. 256–267 (1999)Google Scholar
  14. 14.
    Kuo, T.-W., Lin, K.-J., Wang, Y.-C.: An open real-time environment for parallel and distributed systems. In: Proc. of 20th International Conference on Distributed Computing Systems, April 2000, pp. 206–213 (2000)Google Scholar
  15. 15.
    Wang, Y.C., Lin, K.J.: Implementing a general real-time scheduling framework in the RED-Linux real-time kernel. In: Proc. of the 20th IEEE Real-Time Systems Symposium, December 1999, pp. 246–255 (1999)Google Scholar
  16. 16.
    Lin, K.J., Wang, Y.C.: The design and implementation of real-time schedulers in RED-linux. Proc. of the IEEE 91(7), 1114–1130 (2003)CrossRefGoogle Scholar
  17. 17.
    Brandt, S.A., Banachowski, S., Lin, C., Bisson, T.: Dynamic integrated scheduling of hard real-time, soft real-time and non-real-time processes. In: Proc. of the 24th IEEE Real-Time Systems Symposium, December 2003, pp. 396–407 (2003)Google Scholar
  18. 18.
    Goddard, S., Xu, L.: A variable rate execution model. In: Proc. of the 16th Euromicro Conference on Real-Time Systems, July 2004, pp. 135–143 (2004)Google Scholar
  19. 19.
    Buttazzo, G.C., Lipari, G., Caccamo, M., Abeni, L.: Elastic scheduling for flexible workload management. IEEE Transactions on Computers 51(3), 289–302 (2002)CrossRefGoogle Scholar
  20. 20.
    Banachowski, S., Bisson, T., Brandt, S.A.: Integrating best-effort scheduling into a real-time system. In: Proc. of the 25th IEEE Real-Time Systems Symposium, December 2004, pp. 139–150 (2004)Google Scholar
  21. 21.
    Marzario, L., Lipari, G., Balbastre, P., Crespo, A.: IRIS: A new reclaiming algorithm for server-based real-time systems. In: Proc. of 10th IEEE Real-time and Embedded Technology and Applications Symposium, May 2004, pp. 211–218 (2004)Google Scholar
  22. 22.
    Lipari, G., Buttazzo, G.C.: Scheduling real-time multitask applications in an open system. In: Proc. of the 11th Euromicro Conference on Real-Time Systems (June 1999)Google Scholar
  23. 23.
    Spuri, M., Buttazzo, G.: Scheduling Aperiodic Tasks in Dynamic Priority Systems. In: Proc. of the 17th IEEE Real-Time Systems Symposium, December 1996, pp. 179–210 (1996)Google Scholar
  24. 24.
  25. 25.
    Stoica, I., Abdel-Wahab, H., Jeffay, K., Baruah, S.K., Gehrke, J.E., Plaxton, C.G.: A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems. In: Proc. of the 17th IEEE Real-Time Systems Symposium, pp. 288–299 (1996)Google Scholar
  26. 26.
    Kuo, T.-W., Yang, W.-R., Lin, K.-J.: EGPS: A Class of Real-Time Scheduling Algorithms Based on Processor Sharing. In: Proc. of the 10th Euromicro Workshop on Real-Time Systems, June 1998, pp. 27–34 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pengliu Tan
    • 1
  • Hai Jin
    • 1
  • Minghu Zhang
    • 1
  1. 1.Cluster and Grid Computing Lab., School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations