A response-time bound in fixed-priority scheduling with arbitrary deadlines

IEEE Transactions on Computers

Volumn 58, Issue 2, 2009, Pages 279-286

  Bini, Enrico ^a   Nguyen, Thi Huyen Châu ^b   Richard, Pascal ^b   Baruah, Sanjoy K ^c  

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

^b UNIVERSITÉ DE POITIERS   (France)

^c Brooks Computer Science Building   (United States)

Author keywords

Approximation schemesResource augmentation; Fixed priority scheduler; Response time

Indexed keywords

APPROXIMABILITY; ARBITRARY DEADLINES; DESIGN PROCESS; EXACT COMPUTATIONS; FIXED PRIORITIES; FIXED-PRIORITY SCHEDULERS; INTERACTIVE DESIGN; PRIORITY SCHEDULING; REAL-TIME APPLICATION; RESPONSE TIME; SPORADIC TASK SYSTEMS; TIME BOUND; UNIPROCESSORS; WORST CASE; WORST CASE RESPONSE TIME;

REAL TIME SYSTEMS; SCHEDULING;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 69549141707     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2008.167     Document Type: Article

References (26)

1. M. Joseph and P.K. Pandya, "Finding Response Times in a Real-Time System," Computer J., vol.29, no.5, pp. 390-395, Oct. 1986.
2. N.C. Audsley, A. Burns, M. Richardson, K.W. Tindell, and A.J. Wellings, "Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling," Software Eng. J., vol.8, no.5, pp. 284-292, Sept. 1993.
3. R. Racu, A. Hamann, and R. Ernst, "A Formal Approach to Multi- Dimensional Sensitivity Analysis of Embedded Real-Time Systems," Proc. 18th Euromicro Conf. Real-Time Systems (ECRTS '06), pp. 3-12, July 2006.
4. K.W. Tindell, A. Burns, and A. Wellings, "An Extendible Approach for Analysing Fixed Priority Hard Real-Time Tasks," Real-Time Systems, vol.6, no.2, pp. 133-152, Mar. 1994.
5. J.C. Palencia and M. González Harbour, "Schedulability Analysis for Tasks with Static and Dynamic Offsets," Proc. 19th IEEE Real-Time Systems Symp. (RTSS '98), pp. 26-37, Dec. 1998.
6. J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadline," Proc. 11th IEEE Real-Time Systems Symp. (RTSS '90), pp. 201-209, Dec. 1990.
7. R.L. Davis, A. Burns, R.J. Bril, and J.J. Lukkien, "Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited, and Revised," Real- Time Systems, vol.35, pp. 239-272, 2007.
8. J.P. Lehoczky, L. Sha, and Y. Ding, "The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior," Proc. 10th IEEE Real-Time Systems Symp. (RTSS '89), pp. 166-171, Dec. 1989.
9. Y. Manabe and S. Aoyagi, "A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling," Real-Time Systems, vol.14, no.2, pp. 171-181, Mar. 1998.
10. E. Bini and G.C. Buttazzo, "Schedulability Analysis of Periodic Fixed Priority Systems," IEEE Trans. Computers, vol.53, no.11, pp. 1462-1473, Nov. 2004.
11. M. Sjödin and H. Hansson, "Improved Response-Time Analysis Calculations," Proc. 19th IEEE Real-Time Systems Symp. (RTSS '98), pp. 399-408, Dec. 1998.
12. J. Mäki-Turja and M. Nolin, "Efficient Implementation of Tight Response- Times for Tasks with Offsets," Real-Time Systems, Feb. 2008.
13. K. Albers and F. Slomka, "An Event Stream Driven Approximation for the Analysis of Real-Time Systems," Proc. 16th Euromicro Conf. Real-Time Systems (ECRTS '04), pp. 187-195, June 2004.
14. N. Fisher and S. Baruah, "A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems," Proc. 17th Euromicro Conf. Real-Time Systems (ECRTS '05), pp. 117-126, July 2005.
15. P. Richard, J. Goossens, and N. Fisher, "Approximate Feasibility Analysis and Response-Time Bounds of Static-Priority Tasks with Release Jitters," Proc. 15th Int'l Conf. Real-Time and Network Systems (RTNS '07), Mar. 2007.
16. E. Bini and S.K. Baruah, "Efficient Computation of Response Time Bounds under Fixed-Priority Scheduling," Proc. 15th Int'l Conf. Real-Time and Network Systems (RTNS '07), Mar. 2007.
17. W.-C. Lu, J.-W. Hsieh, and W.-K. Shih, "A Precise Schedulability Test Algorithm for Scheduling Periodic Tasks in Real-Time Systems," Proc. 21st Ann. ACM Symp. Applied Computing (SAC '06), pp. 1451-1455, Apr. 2006.
18. A.K.-L. Mok, "Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment," PhD dissertation, Dept. Electrical Eng. and Computer Science, Massachusetts Inst. Technology, May 1983.
19. 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, Dec. 1990.
20. 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.
21. J.Y.-T. Leung and J. Whitehead, "On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks," Performance Evaluation, vol.2, no.4, pp. 237-250, Dec. 1982.
22. 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.
23. E. Bini, G.C. Buttazzo, and G.M. Buttazzo, "Rate Monotonic Scheduling: The Hyperbolic Bound," IEEE Trans. Computers, vol.52, no.7, pp. 933-942, July 2003.
24. L. Sha, R. Rajkumar, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol.39, no.9, pp. 1175-1185, Sept. 1990.
25. T.P. Baker, "Stack-Based Scheduling of Real-Time Processes," Real-Time Systems, vol.3, no.1, pp. 67-100, 1991.
26. E. Bini and G.C. Buttazzo, "Measuring the Performance of Schedulability Tests," Real-Time Systems, vol.30, nos. 1/2, pp. 129-154, May 2005.