Mixed criticality systems with weakly-hard constraints
O Gettings, S Quinton, RI Davis - … of the 23rd International Conference on …, 2015 - dl.acm.org
Current adaptive mixed criticality scheduling policies assume a high criticality mode in which
all low criticality tasks are descheduled to ensure that high criticality tasks can meet timing …
all low criticality tasks are descheduled to ensure that high criticality tasks can meet timing …
Balancing bandwidth utilization and interrupts: Two heuristic algorithms for the optimized design of automotive CPS
To realize the optimized design of the automotive cyber-physical system, it is required to
consider the interplay between the communication and computation. However, the existing …
consider the interplay between the communication and computation. However, the existing …
From code to weakly hard constraints: A pragmatic end-to-end toolchain for timed c
Complex real-time systems are traditionally developed in several disjoint steps:(i)
decomposition of applications into sets of recurrent tasks,(ii) worst-case execution time …
decomposition of applications into sets of recurrent tasks,(ii) worst-case execution time …
Quantifying the exact sub-optimality of non-preemptive scheduling
RI Davis, A Thekkilakattil, O Gettings… - 2015 IEEE Real …, 2015 - ieeexplore.ieee.org
Fixed priority scheduling is used in many real-time systems, however, both preemptive and
non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to …
non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to …
Scheduling data gathering with maximum lateness objective
J Berlińska - Parallel Processing and Applied Mathematics: 12th …, 2018 - Springer
In this paper, scheduling in a star data gathering network is studied. The worker nodes of the
network produce datasets that have to be gathered by a single base station. The datasets …
network produce datasets that have to be gathered by a single base station. The datasets …
Exact speedup factors and sub-optimality for non-preemptive scheduling
Fixed priority scheduling is used in many real-time systems; however, both preemptive and
non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to …
non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to …
[PDF][PDF] Study on enhancement on software quality by scheduling techniques of real time systems
S Aqeel - European Journal of Advances in Engineering and …, 2017 - researchgate.net
Real time systems are type of operating systems that respond with respect to time. Quality of
real time systems is of at most importance as failure of system can lead to severe results …
real time systems is of at most importance as failure of system can lead to severe results …
[HTML][HTML] Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals
M Short - Applied computing and informatics, 2017 - Elsevier
Embedded systems consist of one or more processing units which are completely
encapsulated by the devices under their control, and they often have stringent timing …
encapsulated by the devices under their control, and they often have stringent timing …
Limited Preemptive Scheduling in Real-time Systems
A Thekkilakattil - 2016 - diva-portal.org
Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side
effects when scheduling real-time tasks, mainly in the form of preemption overheads and …
effects when scheduling real-time tasks, mainly in the form of preemption overheads and …
Applied Computing and Informatics
H Aboalsamh, AM Al-Dhelaan… - King Saud …, 2015 - cntttest.vanlanguni.edu.vn
This paper proposes and evaluates the novel utilization of small world network properties for
the formation of team of players with both best performances and best belongingness within …
the formation of team of players with both best performances and best belongingness within …