An FPTAS for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation

IEEE Transactions on Computers

Volumn 64, Issue 7, 2015, Pages 1805-1818

  Nguyen, Thi Huyen Chau ^a   Richard, Pascal ^b   Grolleau, Emmanuel ^b  

^a VIETNAM NATIONAL UNIVERSITY   (Viet Nam)

^b UNIVERSITÉ DE POITIERS   (France)

Author keywords

approximation algorithm; arbitrary deadlines; feasibility analysis; fixed priority tasks; resource augmentation; Response time analysis

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; FIXED PLATFORMS; INTERACTIVE COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS; RESPONSE TIME (COMPUTER SYSTEMS);

ARBITRARY DEADLINES; FEASIBILITY ANALYSIS; FIXED PRIORITIES; RESOURCE AUGMENTATION; RESPONSE-TIME ANALYSIS;

REAL TIME SYSTEMS;

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

References (31)

1. J. C. Liu and J. W. Layland,"Scheduling algorithms for multiprogramming in hard real-time environment," J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
2. J. Y. T. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic, real-time tasks," Perform. Eval., vol. 2, pp. 273-250, 1982.
3. N. C. Audsley, Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times. York, U.K.: Dept. Comput. Sci., Univ. York, 1991.
4. R. Davis, A. Zabos, and A. Burns, "Efficient exact schedulability tests for fixed priority real-time systems," IEEE Trans. Comput., vol. 57, no. 9, pp. 1261-1276, Sep. 2008.
5. F. Eisenbrand and T. Rothvoss, "Static-priority real-time scheduling: Response time computation is np-hard," in Proc. Real-Time Syst. Symp., 2008, pp. 397-406.
6. R. Santos, G. Lipari, E. Bini, and T. Cucinotta, "On-line schedulability tests for adaptive reservations in fixed priority scheduling,"Real-Time Syst., vol. 48, pp. 601-634, 2012.
7. H. Zeng and M. Di Natale, "An efficient formulation of the real-time feasibility region for design optimization," IEEE Trans. Comput., vol. 62, no. 4, pp. 644-661, Apr. 2013.
8. Q. Zhu, H. Zeng, W. Zheng, M. D. Natale, and A. Sangiovanni- Vincentelli, "Optimization of task allocation and priority assignment in hard real-time distributed systems," ACM Trans. Embed. Comput. Syst., vol. 11, no. 4, pp. 1-30, Jan. 2013.
9. T.-W. Kuo, L.-P. Chang, Y.-H. Liu, and K.-J. Lin, "Efficient online schedulability tests for real-time systems," IEEE Trans. Softw. Eng., vol. 29, no. 8, pp. 734-751, Aug. 2003.
10. N. Fisher and S. Baruah, "A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines," in Proc. Euromicro Int. Conf. Real-Time Syst., Jul. 2005, pp. 117-126.
11. R. I. Davis and A. Burns, "Response time upper bounds for fixed priority real-time system," in Proc. IEEE Int. Symp. Real-Time Syst., 2008, pp. 407-418.
12. E. Bini, T. Nguyen, P. Richard, and S. Baruah, "A response-time bounds in fixed-priority scheduling with arbitrary deadlines,"IEEE Trans. Comput., vol. 58, no. 2, pp. 279-286, Feb. 2009.
13. T. H. C. Nguyen, P. Richard, and E. Bini, "Approximation techniques for response-time analysis of static-priority tasks," Real-Time Syst., vol. 43, pp. 147-176, 2009.
14. B. Kalyanasundaram and K. Pruhs, "Speed is as powerful as clairvoyance," J. ACM, vol. 47, no. 4, pp. 617-643, Jul. 2000.
15. T. H. C. Nguyen, P. Richard, and N. Fisher, "The fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines revisited,"in Proc. Int. Conf. Real-Time Netw. Syst., 2010.
16. E. Bini and S. Baruah, "Efficient computation of response time bounds under fixed-priority scheduling," in Proc. Int. Real-Time and Netw. Syst., 2007, pp. 105-112.
17. J. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm: exact characterization and average case behavior," in Proc. IEEE Int. Real-Time Syst. Symp., 1989, pp. 166-171.
18. M. Josephand P. Pandya,"Finding response times in a real-time systems," Comput. J., vol. 29, no. 5, pp. 390-395, 1986.
19. Y. Manabee and S. Aoyagi, "A feasible decision algorithm for rate monotonic and deadline monotonic scheduling," Real-Time Syst. J., vol. 14, pp. 171-181, 1998.
20. M. Sjodin and H. Hansson, "Improved response time analysis calculations,"in Proc. IEEE Int. Symp. Real-Time Syst., 1998, pp. 399-408.
21. R. Bril, W. Verhaege, and E. Pol, "Initial values for on-line response time calculations," in Proc. Int Euromicro Conf. Real-Time Syst., 2003, pp. 13-22.
22. V. Bonifaci, A. Marchetti-Spaccamela, N. Megow, and A. Wiese, "Polynomial-time exact schedulability tests for harmonic realtime tasks," in Proc. 34th IEEE Real-Time Syst. Symp., 2013, pp. 236-245.
23. J. Lehoczky, "Fixed priority scheduling of periodic tasks with arbitrary deadlines," in Proc. IEEE Int. Real-Time Syst. Symp., 1990, pp. 201-209.
24. P. Richard and J. Goossens, "Approximating response times for static-priority tasks with release jitters," in Proc. WIP, Euromicro Int. Conf. Real-Time Syst., 2006.
25. S. Baruah, "Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling," Real-Time Syst., vol. 47, pp. 517-533, 2011.
26. S. Chakraborty, S. Kunzli, and L. Thiele, "Approximate schedulability analysis," in Proc. Int. Symp. Real-Time Syst., 2002, pp. 159-168.
27. N. Fisher and S. Baruah, "A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines," in Proc. Int. Conf. Real-Time Netw. Syst., 2005, pp. 233-249.
28. R. Bril, J. Lukkien and W. Verhaegh," Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption," Real-Time Syst., vol. 42, nos. 1-3, pp. 63-119, 2009.
29. G. Yao, G. C. Buttazzo, and M. Bertogna, "Feasibility analysis under fixed priority scheduling with fixed preemption points," in Proc. 16th IEEE Int. Conf. Embedded Real-Time Comput. Syst. Appl., 2010, pp. 71-80.
30. T. H. C. Nguyen, N. S. Tran, V. H. Le, and P. Richard, "Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption," in Proc. 21st Int. Conf. Real-Time Netw. Syst., 2013, pp. 265-274.
31. E. Bini and G. Buttazzo,"Measuring the performance of schedulability tests," J. Real-Time Syst., vol. 30, nos. 1/2, pp. 129-154, 2005.