The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2009 vol.58)
pp: 480-495
Xiaobo Sharon Hu , University of Notre Dame, Notre Dame
Michael D. Lemmon , University of Notre Dame, Notre Dame
The elastic task model is a powerful model for adapting periodic real-time systems in the presence of uncertainty. This work generalizes the existing elastic scheduling approach in several directions. First, it presents a general framework, which formulates a trade-off between task schedulability and a specific performance metric as an optimization problem. Such a framework allows real-time systems under overloads to graciously adapt by adjusting their performance level. Second, it is shown in this work that the well-known task compression algorithm in fact solves a quadratic programming problem that seeks to minimize the sum of the squared deviation of a task's utilization from initial desired utilization. This finding indicates that the task compression algorithm may be applied to efficiently solve other similar types of problems that often arise in real-time applications. In particular, an iterative approach is proposed to solve the period selection problem for real-time tasks with deadlines less than respective periods. Further, the framework is adapted to solve the deadline selection problem, which is useful in some control systems with fixed periods.
Real-time and embedded systems, sequencing and scheduling, performance of systems.
Xiaobo Sharon Hu, Michael D. Lemmon, "Generalized Elastic Scheduling for Real-Time Tasks", IEEE Transactions on Computers, vol.58, no. 4, pp. 480-495, April 2009, doi:10.1109/TC.2008.175
[1] H. Aydin, R. Melhem, D. Mosse, and P. Alvarez, “Optimal Reward-Based Scheduling for Periodic Real-Time Tasks,” Proc. 20th IEEE Real-Time Systems Symp. (RTSS '99), pp. 79-89, 1999.
[2] J. Baillieul and P. Antsaklis, “Special Issue on Networked Control Systems” IEEE Trans. Automatic Control, vol. 49, no. 9, pp. 1421-1423, Sept. 2004.
[3] S. Baruah, N. Cohen, G. Plaxton, and D. Varvel, “Proportionate Progress: A Notion of Fairness in Resource Allocation,” Algorithmica, vol. 15, no. 6, pp. 600-625, June 1996.
[4] S. Baruah, L. Rosier, and R. Howell, “Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor,” Real-Time Systems, vol. 2, no. 4, pp.301-324, Nov. 1990.
[5] S.K. Baruah, A.K. Mok, and L.E. Rosier, “Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor,” Proc. 11th IEEE Real-Time Systems Symp. (RTSS '90), pp. 182-190, 1990.
[6] G. Bernat, A. Burns, and A. Llamosí, “Weakly Hard Real-Time Systems,” IEEE Trans. Computers, vol. 50, no. 4, pp. 308-321, Apr. 2001.
[7] E. Bini and G. Buttazzo, “The Space of EDF Feasible Deadlines,” Proc. 19th Euromicro Conf. Real-Time Systems (ECRTS '07), pp. 19-28, 2007.
[8] E. Bini and M.D. Natale, “Optimal Task Rate Selection in Fixed Priority Systems,” Proc. 26th IEEE Real-Time Systems Symp. (RTSS'05), pp. 399-409, 2005.
[9] G. Buttazzo and L. Abeni, “Smooth Rate Adaptation through Impedance Control,” Proc. 14th Euromicro Conf. Real-Time Systems (ECRTS '02), pp. 3-10, 2002.
[10] G. Buttazzo, G. Lipari, and L. Abeni, “Elastic Task Model for Adaptive Rate Control,” Proc. 19th IEEE Real-Time Systems Symp. (RTSS '98), pp. 286-295, 1998.
[11] G. Buttazzo, G. Lipari, M. Caccamo, and L. Abeni, “Elastic Scheduling for Flexible Workload Management,” IEEE Trans. Computers, vol. 51, no. 3, pp. 289-302, Mar. 2002.
[12] M. Caccamo, G. Buttazzo, and L. Sha, “Elastic Feedback Control,” Proc. 12th Euromicro Conf. Real-Time Systems (ECRTS'00), pp. 121-128, 2000.
[13] A. Cervin, J. Eker, B. Bernhardsson, and K.-E. Årzén, “Feedback-Feedforward Scheduling of Control Tasks,” Real-Time Systems, vol. 23, no. 1, pp. 25-53, July 2002.
[14] T. Chantem, X. Hu, and M. Lemmon, “Generalized Elastic Scheduling,” Proc. 27th IEEE Real-Time Systems Symp. (RTSS '06), pp. 236-245, 2006.
[15] J.-Y. Chung, J.W. Liu, and K.-J. Lin, “Scheduling Periodic Jobs That Allow Imprecise Results,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1156-1175, Sept. 1990.
[16] J. Eker, P. Hagander, and K.-E. Årzén, “A Feedback Scheduler for Real-Time Controller Tasks,” Control Eng. Practice, vol. 8, no. 12, pp. 1369-1378, Dec. 2000.
[17] P. Gai, L. Abeni, M. Giorgi, and G. Buttazzo, “A New Kernel Approach for Modular Real-Time Systems Development,” Proc. 13th Euromicro Conf. Real-Time Systems (ECRTS '01), pp. 199-208, 2001.
[18] M. Hamdaoui and P. Ramanathan, “A Dynamic Priority Assignment Technique for Streams with $(m,k)$ -Firm Deadlines,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1443-1451, 1995.
[19] M. Hamdaoui and P. Ramanathan, “Evaluating Dynamic Failure Probability for Streams with $(m,k)$ -Firm Deadlines,” IEEE Trans. Computers, vol. 46, no. 12, pp. 1325-1337, Dec. 1997.
[20] N. Kim, M. Ryu, and S. Hong, “Visual Assessment of a Real-Time System Design: A Case Study on a CNC Controller,” Proc. 17th IEEE Real-Time Systems Symp. (RTSS '96), pp. 300-310, 1996.
[21] G. Koren and D. Shasha, “Skip-Over: Algorithms and Complexity for Overloaded Systems That Allow Skips,” Proc. 16th IEEE Real-Time Systems Symp. (RTSS '95), pp. 110-117, 1995.
[22] X. Koutsoukos, R. Tekumalla, B. Natarajan, and C. Lu, “Hybrid Supervisory Utilization Control of Real-Time Systems,” Proc. 11th IEEE Real-Time and Embedded Technology and Applications Symp. (RTAS '05), pp. 12-21, 2005.
[23] T.-W. Kuo and A. Mok, “Load Adjustment in Adaptive Real-Time Systems,” Proc. 12th IEEE Real-Time Systems Symp. (RTSS '91), pp. 160-171, 1991.
[24] C. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[25] J.W.S. Liu, Real-Time Systems. Prentice-Hall, 2000.
[26] C.D. Locke, D.R. Vogel, and T.J. Mesler, “Building a Predictable Avionics Platform in Ada: A Case Study,” Proc. 12th IEEE Real-Time Systems Symp. (RTSS '91), pp. 181-189, 1991.
[27] D. Luenberger, Linear and Nonlinear Programming. Addison-Wesley, 1989.
[28] P. Marti, R. Villa, J. Fuertes, and G. Fohler, “On Real-Time Control Tasks Schedulability,” Proc. European Control Conf. (ECC '01), pp. 2227-2232, 2001.
[29] A. Mok and W. Wang, “Window-Constraint Real-Time Periodic Task Scheduling,” Proc. 22nd IEEE Real-Time Systems Symp. (RTSS '01), pp. 15-24, 2001.
[30] L. Montestruque and M. Lemmon, “CSOnet: A Metropolitan Scale Wireless Sensor-Actuator Network,” Proc. Int'l Workshop Mobile Device and Urban Sensing, 2008.
[31] G. Quan and X. Hu, “Enhanced Fixed-Priority Scheduling with $(m,k)$ -Firm Guarantee,” Proc. 21st IEEE Real-Time Systems Symp. (RTSS '00), pp. 79-98, 2000.
[32] P. Ramanathan, “Overload Management in Real-Time Control Applications Using $(m,k)$ -Firm Guarantee,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 6, pp. 549-559, June 1999.
[33] T.P. Ruggaber, J.W. Talley, and L.A. Montestruque, “Using Embedded Sensor Networks to Monitor, Control and Reduce CSO Events: A Pilot Study,” Environmental Eng. Science, vol. 24, no. 2, pp. 172-182, Mar. 2007.
[34] D. Seto, J. Lehoczky, and L. Sha, “Task Period Selection and Schedulability in Real-Time Systems,” Proc. 19th IEEE Real-Time Systems Symp. (RTSS '98), pp. 188-199, 1998.
[35] D. Seto, J. Lehoczky, L. Sha, and K. Shin, “On Task Schedulability in Real-Time Control Systems,” Proc. 17th IEEE Real-Time Systems Symp. (RTSS '96), pp. 13-21, 1996.
[36] D. Shin, J. Kim, and S. Lee, “Intra-Task Voltage Scheduling for Low-Energy, Hard Real-Time Applications,” IEEE Design and Test of Computers, vol. 18, no. 2, pp. 20-30, Mar./Apr. 2001.
[37] R. Vanderbei, Loqo,, 2008.
[38] R. Vanderbei, “LOQO: An Interior Point Code for Quadratic Programming,” Optimization Methods and Software, vol. 12, no. 5, pp. 451-484, 1999.
[39] P. Wan and M. Lemmon, “Distributed Flow Control Using Embedded Sensor-Actuator Networks for the Reduction of Combined Sewer Overflow (CSO) Events,” Proc. Conf. Decision and Control (CDC '08), (to appear), 2008.
[40] R. West and C. Poellabauer, “Analysis of a Window-Constrained Scheduler for Real-Time and Best-Effort Packet Streams,” Proc. 21st IEEE Real-Time Systems Symp. (RTSS '00), pp. 239-248, 2000.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool