Abstract
As an effective method for detecting the schedulability of real-time tasks on multiprocessor platforms, Response time analysis (RTA) has been deeply researched in recent decades. Most of the existing RTA methods are designed for tasks that can be preempted at any time. However, in some real-time systems, a task may have some fixed preemption points (FPPs) that divide its execution into a series of non-preemptive regions (NPRs). In such environments, the task can only be preempted at its FPPs, which makes existing RTA methods for arbitrary preemption tasks not applicable. In this article, we study the schedulability analysis on tasks with FPPs under both global fixed-priority (G-FP) scheduling and global earliest deadline first (G-EDF) scheduling. First, based on the idea of limiting the time interval between two consecutive executions of an NPR, a novel RTA method for tasks with FPPs under G-FP scheduling is proposed. Second, we propose an effective RTA method for tasks with FPPs under G-EDF scheduling. Finally, extensive simulations are conducted and the results validate the effectiveness of the proposed methods.
- Björn Andersson and Jan Jonsson. 2000. Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA.Google Scholar
- Sanjoy Baruah. 2007. Techniques for multiprocessor global schedulability analysis. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 119--128.Google Scholar
Digital Library
- Sanjoy Baruah and Nathan Fisher. 2005. The partitioned multiprocessor scheduling of sporadic task systems. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 321--329.Google Scholar
Digital Library
- Marko Bertogna. 2008. Real-Time Scheduling Analysis for Multiprocessor Platforms. Ph.D. Dissertation. Scuola Superiore Sant’Anna, Pisa, Italy.Google Scholar
- Marko Bertogna and Sanjoy Baruah. 2011. Tests for global EDF schedulability analysis. Journal of Systems Architecture 57, 5 (2011), 487--497.Google Scholar
Digital Library
- Marko Bertogna and Michele Cirinei. 2007. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 149--160.Google Scholar
Digital Library
- Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2005. Improved schedulability analysis of EDF on multiprocessor platforms. In Proceedings of the Euromicro Conference on Real-Time Systems. IEEE, Los Alamitos, CA, 209--218.Google Scholar
Digital Library
- Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2009. Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Transactions on Parallel and Distributed Systems 20, 4 (2009), 553--566.Google Scholar
Digital Library
- Alessandro Biondi and Youcheng Sun. 2018. On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling. Real-Time Systems 54, 3 (2018), 515--536.Google Scholar
Digital Library
- Vincenzo Bonifaci and Alberto Marchetti-Spaccamela. 2012. Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica 63, 4 (2012), 763--780.Google Scholar
Digital Library
- Reinder J. Bril, Johan J. Lukkien, and Wim F. J. Verhaegh. 2009. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Systems 42, 1--3 (2009), 63--119.Google Scholar
Digital Library
- Alan Burns and Andy J. Wellings. 2001. Real-Time Systems and Programming Languages. 3rd ed. Pearson Education.Google Scholar
- Bipasa Chattopadhyay and Sanjoy Baruah. 2014. Limited-preemption scheduling on multiprocessors. In Proceedings of the 22nd International Conference on Real-Time Networks and Systems. ACM, New York, NY, 225.Google Scholar
Digital Library
- Robert I. Davis and Alan Burns. 2011. Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Systems 47, 1 (2011), 1--40.Google Scholar
Digital Library
- Robert I. Davis and Alan Burns. 2011. A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys 43, 4 (2011), 35.Google Scholar
Digital Library
- Gilles Geeraerts, Joël Goossens, and Markus Lindström. 2013. Multiprocessor schedulability of arbitrary-deadline sporadic tasks: Complexity and antichain algorithm. Real-Time Systems 49, 2 (2013), 171--218.Google Scholar
Digital Library
- Nan Guan, Meiling Han, Chuancai Gu, Qingxu Deng, and Wang Yi. 2015. Bounding carry-in interference to improve fixed-priority global multiprocessor scheduling analysis. In Proceedings of the Conference on Embedded and Real-Time Computing Systems and Applications. IEEE, Los Alamitos, CA, 11--20.Google Scholar
Digital Library
- Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. 2009. New response time bounds for fixed priority multiprocessor scheduling. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 387--397.Google Scholar
Digital Library
- Mathai Joseph and Paritosh Pandya. 1986. Finding response times in a real-time system. Computer Journal 29, 5 (1986), 390--395.Google Scholar
Cross Ref
- Lars Lundberg. 1998. Multiprocessor scheduling of age constraint processes. In Proceedings of the Conference on Real-Time Computing Systems and Applications. IEEE, Los Alamitos, CA, 42--47.Google Scholar
Cross Ref
- Mitra Nasri and Bjorn B. Brandenburg. 2018. An exact and sustainable analysis of non-preemptive scheduling. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 12--23.Google Scholar
- Harini Ramaprasad and Frank Mueller. 2008. Bounding worst-case response time for tasks with non-preemptive regions. In Proceedings of the Real-Time and Embedded Technology and Applications Symposium. IEEE, Los Alamitos, CA, 58--67.Google Scholar
Digital Library
- Youcheng Sun and Marco Di Natale. 2018. Assessing the pessimism of current multicore global fixed-priority schedulability analysis. In Proceedings of the Annual ACM Symposium on Applied Computing. ACM, New York, NY, 575--583.Google Scholar
Digital Library
- Youcheng Sun and Giuseppe Lipari. 2015. Response time analysis with limited carry-in for global earliest deadline first scheduling. In Proceedings of the Real-Time Systems Symposium. IEEE, Los Alamitos, CA, 130--140.Google Scholar
Digital Library
- Youcheng Sun, Giuseppe Lipari, Nan Guan, and Wang Yi. 2014. Improving the response time analysis of global fixed-priority multiprocessor scheduling. In Proceedings of the Conference on Embedded and Real-Time Computing Systems and Applications. IEEE, Los Alamitos, CA, 1--9.Google Scholar
- Abhilash Thekkilakattil, Sunandan Baruah, Radu Dobrin, and Sasikumar Punnekkat. 2014. The global limited preemptive earliest deadline first feasibility of sporadic real-time tasks. In Proceedings of the Euromicro Conference on Real-Time Systems. IEEE, Los Alamitos, CA, 301--310.Google Scholar
Digital Library
- Abhilash Thekkilakattil, Robert I. Davis, Radu Dobrin, Sasikumar Punnekkat, and Marko Bertogna. 2015. Multiprocessor fixed priority scheduling with limited preemptions. In Proceedings of the Conference on Real Time and Networks Systems. ACM, New York, NY, 13--22.Google Scholar
Digital Library
- Abhilash Thekkilakattil, Kaiqian Zhu, Yonggao Nie, Radu Dobrin, and Sasikumar Punnekkat. 2016. An empirical investigation of eager and lazy preemption approaches in global limited preemptive scheduling. In Proceedings of the Ada-Europe International Conference on Reliable Software Technologies. 163--178.Google Scholar
Digital Library
- Gang Yao, Giorgio Buttazzo, and Marko Bertogna. 2011. Feasibility analysis under fixed priority scheduling with limited preemptions. Real-Time Systems 47, 3 (2011), 198--223.Google Scholar
Digital Library
- Quan Zhou, Guohui Li, and Jianjun Li. 2017. Improved carry-in workload estimation for global multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems 28, 9 (2017), 2527--2538.Google Scholar
Digital Library
- Quan Zhou, Guohui Li, Jianjun Li, and Chenggang Deng. 2018. Execution-efficient response time analysis on global multiprocessor platforms. IEEE Transactions on Parallel and Distributed Systems 29, 12 (2018), 2785--2797.Google Scholar
Cross Ref
Index Terms
Response Time Analysis for Tasks with Fixed Preemption Points under Global Scheduling
Recommendations
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
Special Issue on Embedded Platforms for Crypto and Regular PapersThis article introduces schedulability analysis for Global Fixed Priority Scheduling with Deferred Preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of Global Fixed Priority Preemptive Scheduling (gFPPS) and Global Fixed ...
Improved Schedulability Tests for Global Fixed-Priority Scheduling
ECRTS '11: Proceedings of the 2011 23rd Euromicro Conference on Real-Time SystemsIn this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks is addressed. First, we propose a priority-assignment policy, called ISM-US, for implicit-deadline task systems. Policy ISM-US assigns slack monotonic ...
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99: Proceedings of the Sixth International Conference on Real-Time Computing Systems and ApplicationsThe notion of preemption threshold is initiated in the industry to provide flexibility for real-time and embedded system designs. However, it also brings new contents to scheduling theory. Historically, the scheduling model are divided into two ...






Comments