Firmness Analysis of Real-Time Applications Under Static-Priority Preemptive Scheduling

(m, k)-firm real-time tasks must meet the deadline of at least m jobs out of any k consecutive jobs to satisfy the firmness requirement. Scheduling of an (m,k)-firm task requires firmness analysis, whose results are used to provide system-level guarantees on the satisfaction of firmness conditions. We address firmness analysis of an (m, k)-firm task that is intended to be added to a set of asynchronous tasks scheduled under a Static-Priority Preemptive (SPP) policy. One of the main causes of deadline misses in periodic tasks running under an SPP policy is interference from higher priority tasks. Since the synchrony between the newly added task and higher priority tasks is unknown, the interference from the higher priority tasks is also unknown. We propose an analytic Firmness Analysis (FAn) method to obtain a synchrony that results in the maximum minimum number of deadline hit jobs in any k consecutive jobs of the task. Scalability of FAn is compared with that of existing work – a brute-force search approach – and a timed-automata model of the problem that is analysed using the reachability check of the Uppaal model checker. Our method substantially reduces the complexity of the analysis.

[1]  José Rufino,et al.  Response Time Analysis of Asynchronous Periodic and Sporadic Tasks Sheduled by a Fixed Priority Preemptive Algorithm , 2008, 2008 Euromicro Conference on Real-Time Systems.

[2]  Kim G. Larsen,et al.  The Impressive Power of Stopwatches , 2000, CONCUR.

[3]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[4]  W. P. M. H. Heemels,et al.  Sample-drop firmness analysis of TDMA-scheduled control applications , 2016, 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES).

[5]  Yeonhwa Kong,et al.  Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors , 2011, 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies.

[6]  Rolf Ernst,et al.  System-level timing feasibility test for cyber-physical automotive systems , 2016, 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES).

[7]  Ye-Qiong Song,et al.  ANALYSIS OF NETWORKED CONTROL SYSTEM WITH PACKET DROPS GOVERNED BY (m,k)-FIRM CONSTRAINT , 2005 .

[8]  Christian Poellabauer,et al.  Analysis of a window-constrained scheduler for real-time and best-effort packet streams , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[9]  Dayang N. A. Jawawi,et al.  A weakly hard real-time tasks on global scheduling of multiprocessor systems , 2015, 2015 9th Malaysian Software Engineering Conference (MySEC).

[10]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[11]  Frank S. de Boer,et al.  Schedulability of asynchronous real-time concurrent objects , 2009, J. Log. Algebraic Methods Program..

[12]  Alan Burns,et al.  Weakly Hard Real-Time Systems , 2001, IEEE Trans. Computers.

[13]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[14]  W. P. M. H. Heemels,et al.  Performance analysis and controller improvement for linear systems with (m, k)-firm data losses , 2016, 2016 European Control Conference (ECC).

[15]  Jonathan M. Borwein,et al.  Fixed point iterations for real functions , 1991 .

[16]  Wang Yi,et al.  UPPAAL 4.0 , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[17]  Jia Ning,et al.  Impact of a (m,k)-firm Data Dropouts Policy on the Quality of Control , 2006, 2006 IEEE International Workshop on Factory Communication Systems.

[18]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..