ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m, k)-Firm Deadlines

  • Cho, Hyeon-Joong (Department of Computer and Information Science, Korea University) ;
  • Chung, Yong-Wha (Department of Computer and Information Science, Korea University) ;
  • Park, Dai-Hee (Department of Computer and Information Science, Korea University)
  • Received : 2009.09.16
  • Accepted : 2010.02.06
  • Published : 2010.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

Keywords

References

  1. M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Trans. Comput., vol. 44, no. 2, 1995, pp. 1443-1451. https://doi.org/10.1109/12.477249
  2. G. Bernat and R. Cayssials, "Guaranteed On-Line Weakly-Hard Real-Time Systems," IEEE Real-Time System Symp., 2001.
  3. P. Ramanathan, "Overload Management in Real-Rime Control Applications Using (m, k)-Firm Guarantee," IEEE Trans. Parallel Distrib. Syst., vol. 10, no. 6, June 1999, pp. 549-559. https://doi.org/10.1109/71.774906
  4. C.L. Liu, and J.W Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, 1973, pp. 46-61. https://doi.org/10.1145/321738.321743
  5. M. Hamdaoui and P. Ramanathan, "Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines," IEEE Trans. Comput., vol. 46, no. 12, Dec. 1997, pp. 1325-1337. https://doi.org/10.1109/12.641933
  6. G. Bernat, A. Burns, and A. Llamosi, "Weakly-Hard Real-Time Systems," IEEE Trans. Comput., vol. 50, no. 4, Apr. 2001, pp. 308-321. https://doi.org/10.1109/12.919277
  7. J. Chen et al., "Scalability and QoS Guarantee for Streams with (m,k)-Firm Deadline," Computer Standards and Interfaces, vol. 28, issue 5, Jun. 2006, pp. 560-571. https://doi.org/10.1016/j.csi.2005.02.003
  8. Z. Wang, J.M. Chen, and Y.X. Sun, "An Integrated DBP for Streams with (m,k)-Firm Real-Time Guarantee," J. Zhejiang University Science, vol. 5, no. 7, 2004, pp. 816-826, https://doi.org/10.1631/jzus.2004.0816
  9. E. Poggi et al., "Matrix-DBP For (m, k)-Firm Real-Time Guarantee," Proc. Real-Time and Embedded System, 2003, pp. 457-482.
  10. J. Chen et al,, "Equivalent Matrix DBP for Streams with (m,k)-Firm Deadline," IEEE Int. Symp. Ind. Electron., vol. 1, May 2004, pp. 675-680.
  11. G. Quan and X. Hu, "Enhanced Fixed-Priority Scheduling with (m,k)-Firm Guarantee," IEEE RTSS, 2000, pp. 79-88.
  12. G. C. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, Kluwer Academic Publishers, 1997.
  13. J. Lin and A.M.K. Cheng, "Maximizing Guaranteed QoS in (m,k)-Firm Real-Time Systems," IEEE Int. Conf. Embedded and Real-Time Computing, 2006.
  14. J. Li, Y. Song, and F. Simonot-Lion, "Providing Real-Time Applications with Graceful Degradation of QoS and Fault Tolerance According to (m,k)-Firm Model," IEEE Trans. Ind. Inf., May 2006, pp. 112-119.
  15. F. Flavia et al., "Optimal On-Line (m,k)-Firm Constraint Assignment for Real-Time Control Tasks Based on Plant State Information," IEEE Int. Conf. Emerging Technologies and Factory Automation, 2008, pp. 908-915.
  16. A. Striegel and G. Manimaran. "Best-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks," Proc. 15 IPDPS 2000 Workshops Parallel Distrib. Process., 2000, pp 743-751.
  17. S. Lai, B. Ravindran, and H. Cho, "On Scheduling Soft Real- Time Tasks with Lock-Free Synchronization for Embedded Devices," ACM Symp. Applied Computing (SAC), Mar. 2009, pp. 1685-1686.
  18. T. Wu and S. Jin, "Weakly Hard Real-Time Scheduling Algorithm for Multimedia Embedded System on Multiprocessor Platform," IEEE Int. Conf. Ubi-Media Computing, 2008.
  19. L. Niu and G. Quan, "A Hybrid Static/Dynamic DVS Scheduling for Real-Time Systems with (m, k)-Guarantee," IEEE Int. Real-Time Systems Symp., 2006.
  20. C.D. Locke, Best Effort Decision Making for Real-Time Scheduling, PhD Thesis, Carnegie Mellon University, 1986.

Cited by

  1. (m,k)-firm pattern spinning to improve the GTS allocation of periodic messages in IEEE 802.15.4 networks vol.2013, pp.None, 2010, https://doi.org/10.1186/1687-1499-2013-222
  2. A guaranteed real-time scheduling algorithm for (m,k)-firm deadline-constrained tasks on multiprocessors vol.59, pp.5, 2010, https://doi.org/10.4103/0377-2063.123767