An analysis of lazy and eager limited preemption approaches under DAG-based global fixed priority scheduling
MA Serrano, A Melani, S Kehr… - 2017 IEEE 20th …, 2017 - ieeexplore.ieee.org
DAG-based scheduling models have been shown to effectively express the parallel
execution of current many-core heterogeneous architectures. However, their applicability to …
execution of current many-core heterogeneous architectures. However, their applicability to …
Response time analysis for tasks with fixed preemption points under global scheduling
Q Zhou, G Li, J Li, C Deng, L Yuan - ACM Transactions on Embedded …, 2019 - dl.acm.org
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 …
platforms, Response time analysis (RTA) has been deeply researched in recent decades …
Preemption-Delay Aware Schedulability Analysis of Real-Time Systems
F Marković - 2020 - diva-portal.org
Schedulability analysis of real time systems under preemptive scheduling may often lead to
false negative results, deeming a schedulable taskset being unschedulable. This is the case …
false negative results, deeming a schedulable taskset being unschedulable. This is the case …
Improving the Schedulability of Real Time Systems under Fixed Preemption Point Scheduling
F Markovic - 2018 - diva-portal.org
During the past decades of research in Real-Time systems, non-preemptive scheduling and
fully preemptive scheduling have been extensively investigated, as well as compared with …
fully preemptive scheduling have been extensively investigated, as well as compared with …