Abstract
(m,k)-firm real-time tasks require meeting the deadline of at least m jobs out of any k consecutive jobs. When compared to hard real-time tasks, (m,k)$-firm tasks open up the possibility of tighter resource-dimensioning in implementations. Firmness analysis verifies the satisfaction of (m,k)-firmness conditions. Scheduling policies under which a set of periodic tasks runs on a resource influence the number of deadline missed jobs. Therefore, the nature of the firmness analysis problem depends on scheduling policies. In this work, we present Firmness Analysis (FAn) methods for three common scheduling policies—synchronous and asynchronous Static Priority Preemptive (SPP) policies and Time Division Multiple Access (TDMA). We first introduce the Balloon and Rake problem—the problem of striking the maximum number of balloons in a balloon line with a rake. We show that the common core of firmness analysis problems can be abstracted as the Balloon and Rake problem. Next, we prove that the Finite Point method is a solution to the Balloon and Rake problem. We illustrate how existing FAn methods for the TDMA and asynchronous SPP policies can be adapted to use the same solution framework for the Balloon and Rake problem. Using the solution of the Balloon and Rake problem, we adapt the existing FAn methods to synchronous SPP scheduling policies. The scalability of the FAn methods is compared with that of a timed-automata approach, a brute-force approach, and a Mixed Integer Linear Programing method. The FAn methods scale substantially better to firmness analysis problem instances with a large k and a high number of tasks.
- Benny Akesson, Anna Minaeva, Premysl Sucha, Andrew Nelson, and Zdenek Hanzalek. 2015. An efficient configuration methodology for time-division multiplexed single resources. In Proceedings of the Real-Time and Embedded Technology and Applications Symposium (RTAS’15). IEEE.Google Scholar
Cross Ref
- R. Alur and D. L. Dill. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2 (1994), 183--235.Google Scholar
Digital Library
- A. R. B. Behrouzian, D. Goswami, and T. Basten. 2018. Robust co-synthesis of embedded control systems with occasional deadline misses. In Proceedings of the International Symposium on On-Line Testing and Robust System Design (IOLTS’18).Google Scholar
- A. R. B. Behrouzian, D. Goswami, T. Basten, M. Geilen, H. Alizadeh Ara, and M. Hendriks. 2018. Firmness analysis of real-time applications under static-priority preemptive scheduling. In Proceedings of the Real-Time and Embedded Technology and Applcations Symposium (RTAS’18).Google Scholar
- A. R. B. Behrouzian, D. Goswami, M. Geilen, M. Hendriks, H. Alizadeh Ara, E. P. van Horssen, W. P. M. H. Heemels, and T. Basten. 2016. Sample-drop firmness analysis of TDMA-scheduled control applications. In Proceedings of the International Symposium on Industrial Embedded Systems (SIES’16).Google Scholar
- G. Bernat. 1998. Specification and Analysis of Weakly Hard Real-time Systems. Universitat de les Illes Balears, Spain.Google Scholar
- G. Bernat, A. Burns, and A. Llamosi. 2001. Weakly hard real-time systems. IEEE Trans. Comput. 50, 4 (2001), 308--321.Google Scholar
Digital Library
- T. Bund and F. Slomka. 2015. Worst-case performance validation of safety-critical control systems with dropped samples. In Proceedings of the 23rd International Conference on Real Time and Networks Systems.Google Scholar
- G. Buttazzo. 2011. Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer Science & Business Media.Google Scholar
- F. Cassez and K. Larsen. 2000. The impressive power of stopwatches. In Proceedings of the International Conference on Concurrency Theory. Springer.Google Scholar
- M. Coutinho, J. Rufino, and C. Almeida. 2008. Response time analysis of asynchronous periodic and sporadic tasks sheduled by priority preemptive algorithm. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS’08).Google Scholar
- M. E. M. Ben GaÃŕd, D. Simon, and O. Sename. 2008. Beyond the weakly hard model: Measuring the performance cost of deadline misses. In IFAC Proceedings.Google Scholar
- D. Goswami, R. Schneider, and S. Chakraborty. 2014. Relaxing signal delay constraints in distributed embedded controllers. IEEE Trans. Contr. Syst. Technol. 22, 6 (2014), 2337--2345.Google Scholar
Cross Ref
- M. Hamdaoui and P. Ramanathan. 1995. A dynamic priority assignment technique for streams with -firm deadlines. IEEE Trans. Comput. 44, 12 (1995), 1443--1451.Google Scholar
Digital Library
- Z. A. H. Hammadeh, S. Quinton, and R. Ernst. 2014. Extending typical worst-case analysis using response-time dependencies to bound deadline misses. In Proceedings of the International Conference on Embedded Software (EMSOFT’14).Google Scholar
- H. Ismail, D. Jawawi, and M. Isa. 2015. A weakly hard real-time tasks on global scheduling of multiprocessor systems. In Proceedings of the Software Engineering Conference (MySEC’15).Google Scholar
- Y. Kong and H. Cho. 2011. Guaranteed scheduling for (m, k)-firm deadline-constrained real-time tasks on multiprocessors. In Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT’11).Google Scholar
- J. Y. T. Leung and J. Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perf. Eval. 2, 4 (1982), 237--250.Google Scholar
Cross Ref
- C. L. Liu and J. W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1 (1973), 46--61.Google Scholar
Digital Library
- J. Ning, Y. Song, and L. Rui-Zhong. 2005. Analysis of networked control system with packet drops governed by -firm constraint. In Proceedings of the International Conference on Fieldbus Systems and Their Applications.Google Scholar
- P. Pazzaglia, L. Pannocchi, A. Biondi, and M. Di Natale. 2018. Beyond the weakly hard model: Measuring the performance cost of deadline misses. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS’18).Google Scholar
- S. Quinton, T. Bone, J. Hennig, M. Neukirchner, M. Negrean, and R. Ernst. 2014. Typical worst case response-time analysis and its use in automotive network design. In Proceedings of the 51st Annual Conference on Design Automation. ACM.Google Scholar
- Y. Sun and M. Natale. 2017. Weakly hard schedulability analysis for fixed priority scheduling of periodic real-time tasks. ACM Trans. Embedd. Comput. Syst. 16, 5s (2017), 171.Google Scholar
Digital Library
- S. Tobuschat, R. Ernst, A. Hamann, and D. Ziegenbein. 2016. System-level timing feasibility test for cyber-physical automotive systems. In Proceedings of the International Symposium on Industrial Embedded Systems (SIES’16).Google Scholar
- E. van Horssen, A. Behrouzian, D. Goswami, D. Antunes, T. Basten, and M. Heemels. 2016. Performance analysis and controller improvement for linear systems with (m, k)-firm data losses. In Proceedings of the European Control Conference (ECC’16).Google Scholar
- W. Xu, Z. Hammadeh, A. Kröller, R. Ernst, and S. Quinton. 2015. Improved deadline miss models for real-time systems using typical worst-case analysis. In Proceedings of the 27th Euromicro Conference on Real-Time Systems (ECRTS’15).Google Scholar
- Q. Zhou, G. Li, and J. Li. 2017. Improved carry-in workload estimation for global multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 28, 9 (2017), 2527--2538.Google Scholar
Digital Library
Index Terms
Firmness Analysis of Real-time Tasks
Recommendations
Analysis on quantum-based fixed priority scheduling of real-time tasks
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and CommunicationFixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks
A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks
In this paper, we address the problem of the dynamic scheduling of skippable periodic task sets (i.e., period tasks allowing occasional skips of instances), together with aperiodic tasks. Scheduling of tasks is handled thanks to the merging of two ...






Comments