In this paper, we present a new hierarchical scheduling framework for periodic tasks in symmetric multiprocessor (SMP) platforms. Partitioned and global scheduling are the two main approaches used by SMP based systems where global scheduling is recommended for overall performance and partitioned scheduling is recommended for hard real-time performance. Our approach combines both the global and partitioned approaches of traditional SMP-based schedulers to provide hard real-time performance guarantees for critical tasks and improved response times for soft real-time tasks. Implemented as part of VxWorks, the results are confirmed using a real-time benchmark application, where response times were improved for soft real-time tasks while still providing hard real-time performance.
T. Springer and P. Zhao. Hierarchical scheduling for real-time periodic tasks in symmetric multiprocessing. Computer Science & Information Technology (CS & IT), pp91-11, 2021. https://doi.org/10.5121/csit.2021.110810
AIRCC Publishing Corporation
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
This article was originally published in Computer Science & Information Technology (CS & IT), volume 11, issue 8, in 2021. https://doi.org/10.5121/csit.2021.110810