Subscribe

Issue No.06 - June (2010 vol.59)

pp: 776-783

Jyh-Charn (Steve) Liu , Texas A&M University, College Station

Jianjia Wu , China Center for Information Industry Development

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.31

ABSTRACT

In real-time systems, utilization-based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The test is extremely simple, since it only needs to compare the utilization of the tasks with a predetermined bound. As such, utilization-based schedulability tests are suitable for online use. The challenge is how to derive a reasonable utilization bound for a given system. Most existing results are obtained on a case-by-case basis because of their analytical complexity. In this paper, we develop a flexible and unified representation framework of real-time systems (i.e., tasks and schedulers) based on network calculus techniques. Our representation framework, together with the proposed bound derivation method, leads to a general bound result, which is applicable to a large family of real-time systems.

INDEX TERMS

Workload rate, utilization, schedulability test, network calculus.

CITATION

Jyh-Charn (Steve) Liu, Jianjia Wu, "A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems",

*IEEE Transactions on Computers*, vol.59, no. 6, pp. 776-783, June 2010, doi:10.1109/TC.2010.31REFERENCES

- [1] M. Joseph and P. Pandya, "Finding Response Times in a Real-Time System,"
Computer J., vol. 29, no. 5, pp. 390-395, May 1986.- [2] C.-C. Han and H.-Y. Tyan, "A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithm,"
Proc. 18th IEEE Int'l Real-Time Systems Symp., pp. 36-45, Dec. 1997.- [3] J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,"
Proc. 11th IEEE Int'l Real-Time Systems Symp., pp. 201-209, Dec. 1990.- [4] J.P. Lehoczky and L. Sha, "Performance of Real-Time Bus Scheduling Algorithms,"
ACM SIGMETRICS Performance Evaluation Rev., vol. 14, no. 1, pp. 44-53, May 1986.- [5] C.L. Liu and J.W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,"
J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.- [6] A.K. Mok and D. Chen, "A General Model for Real-Time Tasks," Technical Report TR-96-24, Dept. of Computer Sciences, Univ. of Texas at Austin, Oct. 1996.
- [7] A.K. Mok and D. Chen, "A Multiframe Model for Real-Time Tasks,"
IEEE Trans. Software Eng., vol. 23, no. 10, pp. 635-645, Oct. 1997.- [8] D.-T. Peng and K.G. Shin, "A New Performance Measure for Scheduling Independent Real-Time Tasks,"
J. Parallel Distributing Computing, vol. 19, no. 12, pp. 11-16, Sept. 1993.- [9] G. Agrawal, B. Chen, W. Zhao, and S. Davari, "Guaranteeing Synchronous Message Deadlines with the Timed Token Protocol,"
IEEE Trans. Computers, vol. 43, no. 3, pp. 327-339, Mar. 1994.- [10] N. Malcolm and W. Zhao, "Guaranteeing Synchronous Messages with Arbitrary Deadline Constraints in an FDDI Network,"
Proc. IEEE 18th Local Computer Networks Conf., pp. 186-195, Sept. 1993.- [11] S. Zhang and A. Burns, "An Optimal Synchronous Bandwidth Allocation Scheme for Guaranteeing Synchronous Message Deadlines with the Timed-Token MAC Protocol,"
IEEE/ACM Trans. Networking, vol. 3, no. 6, pp. 729-741, Dec. 1995.- [12] B. Andersson, "Static-Priority Scheduling on Multiprocessors," PhD dissertation, Dept. of Computer Eng., Chalmers Univ. of Tech nology, 2003.
- [13] B. Andersson, S. Baruah, and J. Jonsson, "Static-Priority Scheduling on Multiprocessors,"
Proc. 22nd IEEE Int'l Real-Time Systems Symp., pp. 193-202, Dec. 2001.- [14] B. Andersson and J. Jonsson, "Fixed-Priority Preemptive Multiprocessor Scheduling: To Partition or Not to Partition,"
Proc. Seventh Int'l Conf. Real-Time Computing Systems and Applications, pp. 337-346, Dec. 2000.- [15] T.P. Baker, "Multiprocessor EDF and Deadline Monotonic Schedulability Analysis,"
Proc. 24th IEEE Int'l Real-Time Systems Symp., pp. 120-129, Dec. 2003.- [16] S. Funk, J. Goossens, and S. Baruah, "On-Line Scheduling on Uniform Multiprocessors,"
Proc. 22nd IEEE Int'l Real-Time Systems Symp., pp. 183-192, Dec. 2001.- [17] D. Oh and T.P. Baker, "Utilization Bounds for n-Processor Rate Monotone Scheduling with Static Processor Assignment,"
Real Time Systems J., vol. 15, no. 1, pp. 183-193, Nov. 1998.- [18] T. Abdelzaher and C. Lu, "Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services,"
Proc. Seventh Real-Time Technology and Applications Symp., pp. 15-25, June 2001.- [19] T. Abdelzaher and V. Sharma, "A Synthetic Utilization Bound for Aperiodic Tasks with Resource Requirements,"
Proc. 15th Euromicro Conf. Real-Time Systems, pp. 141-150, July 2003.- [20] T. Abdelzaher, V. Sharma, and C. Lu, "A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling,"
IEEE Trans. Computers, vol. 53, no. 3, pp. 334-350, Mar. 2004.- [21] D. Xuan, C. Li, R. Bettati, J. Chen, and W. Zhao, "Utilization-Based Admission Control for Real-Time Applications,"
Proc. 2000 Int'l Conf. Parallel Processing, pp. 251-262, Aug. 2000.- [22] J.Y. Le Boudec, "Application of Network Calculus to Guaranteed Service Networks,"
IEEE Trans. Information Theory, vol. 44, no. 3, pp. 1087-1096, May 1998.- [23] J.Y. Le Boudec and P. Thiran,
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer-Verlag, 2001.- [24] C.-S. Chang, "On Deterministic Traffic Regulation and Service Guarantee: A Systematic Approach by Filtering,"
IEEE Trans. Information Theory, vol. 44, no. 3, pp. 1097-1110, May 1998.- [25] S. Chang,
Performance Guarantees in Communication Networks. Springer-Verlag, 2000.- [26] R.L. Cruz, "A Calculus for Network Delay, Part I: Network Elements in Isolation,"
IEEE Trans. Information Theory, vol. 37, no. 1, pp. 114-131, Jan. 1991.- [27] R.L. Cruz, "A Calculus for Network Delay, Part II: Network Analysis,"
IEEE Trans. Information Theory, vol. 37, no. 1, pp. 132-141, Jan. 1991.- [28] R.L. Cruz, "Quality of Service Guarantees in Virtual Circuit Switched Networks,"
IEEE J. Selected Areas in Comm., vol. 13, no. 6, pp. 1048-1056, Aug. 1995.- [29] R.L. Cruz, "SCED+: Efficient Management of Quality of Service Guarantees,"
Proc. IEEE INFOCOM '98, pp. 625-642, Mar. 1998.- [30] J. Wu, J.-C. Liu, and W. Zhao, "A Unified and Parameterized Schedulability Bound of Static Priority Schedulers" Technical Report 2008-3-4, Computer Science Dept., Texas A&M Univ., Mar. 2008.
- [31] J. Wu, "General Schedulability Bound Analysis and Its Applications in Real-Time Systems," PhD dissertation, http://txspace. tamu.edu/handle/1969.15854 , Dept. of Computer Science, Texas A&M Univ., 2006.
- [32] J. Wu, J.-C. Liu, and W. Zhao, "Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers,"
Proc. IEEE Real-Time Systems Symp. (RTSS), Dec. 2007.- [33] J. Wu, J.-C. Liu, and W. Zhao, "On Schedulability Bounds of Static Priority Schedulers,"
Proc. 11th IEEE Real-Time and Embedded Technology and Applications Symp., pp. 529-540, Mar. 2005.- [34] J. Wu, J.-C. Liu, and W. Zhao, "A Unified and Parameterized Schedulability Bound of Weighted Round Robin Schedulers," Technical Report 2008-3-5, Computer Science Dept., Texas A&M Univ., Mar. 2008.
- [35] W. Hawkins and T. Abdelzaher, "Towards Feasible Region Calculus: An End-to-End Schedulability Analysis of Real-Time Multistage Execution,"
Proc. IEEE Real-Time Systems Symp., Dec. 2005.- [36] S. Lauzac, R. Melhem, and D. Mossé, "An Improved Rate-Monotonic Admission Control and Its Applications,"
IEEE Trans. Computers, vol. 52, no. 3, pp. 337-350, Mar. 2003.- [37] J. Liebeherr, A. Burchard, Y. Oh, and S.H. Son, "New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems,"
IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1995.- [38] D. Chen, A.K. Mok, and T.-W. Kuo, "Utilization Bound Revisited,"
IEEE Trans. Computers, vol. 52, no. 3, pp. 351-361, Mar. 2003.- [39] T.-W. Kuo and A.K. Mok, "Load Adjustment in Adaptive Real-Time Systems,"
Proc. 12th IEEE Real-Time Systems Symp., pp. 160-171, Dec. 1991.- [40] D.-W. Park, S. Natarajan, A. Kanevsky, and M.J. Kim, "A Generalized Utilization Bound Test for Fixed-Priority Real-Time Scheduling,"
Proc. Second Int'l Workshop Real-Time Computing Systems and Applications, pp. 73-79, Oct. 1995.- [41] C.-G. Lee, L. Sha, and A. Peddi, "Enhanced Utilization Bounds for QoS Management,"
IEEE Trans. Computers, vol. 53, no. 2, pp. 187-200, Feb. 2004.- [42] E. Bini, G.C. Buttazzo, and G. Buttazzo, "Rate Monotonic Analysis: The Hyperbolic Bound,"
IEEE Trans. Computers, vol. 52, no. 7, pp. 933-942, July 2003.- [43] X. Liu and T. Abdelzaher, "On Non-Utilization Bounds for Arbitrary Fixed Priority Policies,"
Proc. 12th IEEE Real-Time and Embedded Technology and Applications Symp. (RTAS '06), 2006.- [44] X. Liu and T. Abdelzaher, "Non-Utilization Bounds and Feasible Regions for Arbitrary Fixed-Priority Policies,"
ACM Trans. Embedded Computing Systems, 2007.- [45] A. Parekh and R.G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case,"
IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.- [46] J. Liebeherr, D.E. Wrege, and D. Ferrari, "Exact Admission Control for Networks with a Bounded Delay Service,"
IEEE/ACM Trans. Networking, vol. 4, no. 6, pp. 885-901, Dec. 1996.- [47] H. Sariowan, "A Service Curve Approach to Performance Guarantees in Integrated Service Networks," PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of California, 1996.
- [48] H. Sariowan, R.L. Cruz, and G.C. Polyzos, "Scheduling for Quality of Service Guarantees via Service Curves,"
Proc. 1995 Int'l Conf. Computer Comm. and Networks, pp. 512-520, Sept. 1995.- [49] C. Li, R. Bettati, and W. Zhao, "New Delay Analysis in High Speed Networks,"
Proc. Int'l Conf. Parallel Processing, pp. 454-461, June 1999.- [50] S. Wang, D. Xuan, R. Bettati, and W. Zhao, "Providing Absolute Differentiated Services for Real-Time Application in Static-Priority Scheduling Networks,"
Proc. IEEE INFOCOM '01, pp. 669-678, Jan. 2001.- [51] S. Wang, D. Xuan, R. Bettati, and W. Zhao, "Providing Absolute Differentiated Services for Real-Time Applications in Static-Priority Scheduling Networks,"
IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 326-339, Apr. 2004.- [52] S. Wang, Z. Mai, W. Magnussen, D. Xuan, and W. Zhao, "Implementation of QoS-Provisioning System for Voice over IP,"
Proc. IEEE Real-Time Technology and Applications Symp. (RTAS), Dec. 2002.- [53] S. Wang, Z. Mai, D. Xuan, and W. Zhao, "Design and Implementation of QoS-Provisioning System for Voice over IP,"
IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 3, pp. 276-288, Mar. 2006.- [54] D.P. Bertsekas,
Constrained Optimization and Lagrange Multiplier Methods. Academic Press, 1982. |