The Criticality-Urgency Quadrant Model: A Systematic Approach to Task Priority Assignment in Real-Time Operating Systems

International Journal of Computer Science and Engineering

© 2026 by SSRG - IJCSE Journal

Volume 13 Issue 3

Year of Publication : 2026

Authors : Azad Mohammed Shaik

10.14445/23488387/IJCSE-V13I3P101

How to Cite?

Azad Mohammed Shaik, "The Criticality-Urgency Quadrant Model: A Systematic Approach to Task Priority Assignment in Real-Time Operating Systems," SSRG International Journal of Computer Science and Engineering , vol. 13,  no. 3, pp. 1-19, 2026. Crossref, https://doi.org/10.14445/23488387/IJCSE-V13I3P101

Abstract:

It is critical to prioritize tasks in an RTOS for safe and efficient operation of the system. Many engineers utilize informal ad hoc techniques to assign task priorities, resulting in missed deadlines, priority inversions, and potentially catastrophic failures in safety-critical areas. This paper introduces the Criticality Urgency Quadrant Model (QUADRANT), a systematic two-dimensional model for classification and assignment of task priorities with orthogonal axes of urgency and criticality. QUADRANT is intended to give practitioners on standard fixed-priority RTOS platforms without formal mixed criticality analysis infrastructure a lightweight, deployable engineering heuristic. The model has been validated through empirical tasks executed with FreeRTOS (POSIX simulation, Linux 5.15, Intel Xeon) and 16 concurrent tasks performing 300,000 iterations of CPU stress workloads over a 120 second time frame, ultimately producing results that can be compared against Rate Monotonic Scheduling (RMS), Deadline Monotonic Scheduling (DMS), Audsley’s Optimal Priority Assignment (OPA) Method using Response Time Analysis (RTA) and ad hoc. Key results indicated that QUADRANT executed with zero deadline misses across all task quadrants under normal conditions, while ad hoc produced 769 total deadline misses (653 Q1); DMS produced 229 misses; RMS produced 688 total deadline misses; the majority of which were located in the critical Q2 monitor, while OPA/RTA declared the task set un-schedulable due to priority scarcity (16 tasks, 10 priorities). This emphasizes a known characteristic of worst-case analysis: the lack of comparability with the average case for performance. OPA and QUADRANT serve different needs as complementary tools, not as competitive algorithms. Additionally, the evaluation performed through three-level stress testing (baseline 45 seconds, rigorous 90 seconds, heavy 120 seconds) and 122,000 total task executions validates graceful degradation under overload conditions. QUADRANT produced 26 minor Q2 misses (0.065% failure rate) under maximum load; while RMS produced 532 Q2 misses and ad hoc produced 12,470 Q2 misses, evidencing superior assignment and execution of task priorities. The results on the POSIX simulation platform are valid; though actual execution timing may be different when executed on bare-metal targets, the relative effectiveness of priority assignment can be easily replicated between platforms. All source code of the open-source FreeRTOS implementations is provided for reproducible research and adoption within automotive, medical, and aerospace industries.

Keywords:

Real-Time Operating Systems, FreeRTOS, Task Priority Assignment, Priority Inversion, Embedded Systems, Scheduling Theory, Deadline Management, Mixed-Criticality Systems, Safety-Critical Software.

References:

[1] Giorgio C. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, 3rd Edition, New York, NY, USA: Springer, 2011.
[CrossRef] [Publisher Link]
[2] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-time Synchronization,” IEEE Transactions on Computers, vol. 39, no. 9, pp. 1175–1185, 1990.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Glenn E. Reeves, “What Really Happened on Mars?,” ACM SIGADA Ada Letters, vol. 17, no. 6, pp. 18–19, 1997.
[Publisher Link]
[4] C.L. Liu, and James W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-real-time Environment,” Journal of the ACM, vol. 20, no. 1, pp. 46–61, 1973.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Joseph Y.-T. Leung, and Jennifer Whitehead, “On the Complexity of Fixed-priority Scheduling of Periodic, Real-time Tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237–250, 1982.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Joseph Y.-T. Leung, and M.L. Merrill, “A Note on Preemptive Scheduling of Periodic, Real-time Tasks,” Information Processing Letters, vol. 11, no. 3, pp. 115–118, 1980.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Neil C. Audsley, “Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times,” Technical Report YCS 164, University of York, Department of Computer Science, 1991.
[Google Scholar] [Publisher Link]
[8] Reinhard Wilhelm et al., “The Worst-case Execution-time Problem—overview of Methods and Survey of Tools,” ACM Transactions on Embedded Computing Systems, vol. 7, no. 3, pp. 1–53, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Steve Vestal, “Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance,” 28th IEEE International Real-time Systems Symposium, 2007.
[Google Scholar]
[10] Alan Burns, and Robert I. Davis, “Mixed Criticality Systems—A Review,” Technical Report, University of York, pp. 1-97, 2017.
[Google Scholar] [Publisher Link]
[11] Benny Akesson et al., “A Comprehensive Survey of Industry Practice in Real-time Systems,” Real-Time Systems, vol. 58, pp. 358–398, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[12] P. Koopman, and M. Wagner, “Challenges in Autonomous Vehicle Testing and Validation,” SAE International Journal of Transportation Safety, vol. 4, no. 1, pp. 15–24, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[13] N. Audsley et al., “Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling,” Software Engineering Journal, vol. 8, no. 5, 1993.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Sanjoy Baruah et al., “Scheduling Real-Time Mixed-Criticality Jobs,” IEEE Transactions on Computers, vol. 61, no. 8, pp. 1140-1152, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Robert I. Davis et al., “Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited and Revised,” Real-Time Systems, vol. 35, pp. 239–272, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[16] International Organization for Standardization, ISO 26262: Road Vehicles Functional Safety, 2018. [Online]. Available: https://www.iso.org/standard/68383.html
[17] Real Time Engineers Ltd, FreeRTOS Documentation, 2023. [Online]. Available: https://www.freertos.org/
[18] Paolo Gai et al., “A Comparison of MPCP and MSRP when Sharing Resources in the Janus Multiple-processor on a Chip Platform,” The 9th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 189-198, 2003.
[Google Scholar]
[19] Sanyo K. Baruah, Alan Burns, and Robert I. Davis, “Response-time Analysis for Mixed Criticality Systems,” 2011 IEEE 32nd Real-Time Systems Symposium, pp. 34-43, 2011.
[Google Scholar]