Results 261 to 270 of about 1,854,282 (287)
Some of the next articles are maybe not open access.
Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points
2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications, 2010Limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and non-preemptive scheduling. In particular, allowing preemption to occur only at predefined preemption points reduces context switch costs, simplifies the access to shared resources, and allows more predictable estimations of worst ...
G. YAO, G. BUTTAZZO, BERTOGNA, Marko
openaire +2 more sources
Efficient Alternatives for Implementing Fixed-Priority Schedulers
2005Fixed-priority schedulers received a lot of attention from the real-time community, and a big effort has been performed to develop accurate and more general schedulability analysis that can ensure the correct execution of the system. Nevertheless, only few works analysed the overhead and blocking intervals introduced by the scheduler and the associated
Sergio Sáez +3 more
openaire +2 more sources
Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling
2012 IEEE 26th International Parallel and Distributed Processing Symposium, 2012Future embedded real-time systems will be deployed on multi-core processors to meet the dramatically increasing high-performance and low-power requirements. This trend appeals to generalize established results on uniprocessor scheduling, particularly the various utilization bounds for schedulability test used in system design, to the multiprocessor ...
Nan Guan +3 more
openaire +2 more sources
Extending fixed task-priority schedulability by interference limitation
Proceedings of the 20th International Conference on Real-Time and Network Systems, 2012While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed task-priority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various
José Marinho +2 more
openaire +3 more sources
Nearest Fixed Points and Concurrent Priority Games
2015As it is known the values of different states in parity games (deterministic parity games, or stochastic perfect information parity games or concurrent parity games) can be expressed by formulas of \(\mu \)-calculus – a fixed point calculus alternating the greatest and the least fixed points of monotone mappings on complete lattices.
Karelovic, Bruno, Zielonka, Wieslaw
openaire +3 more sources
Priority Assignment for Global Fixed Priority Scheduling on Multiprocessors
IEEE Transactions on Computer-Aided Design of Integrated Circuits and SystemsXuanliang Deng +3 more
openaire +1 more source
Energy aware fixed priority scheduling in mixed-criticality systems
Computer Standards and Interfaces, 2023Yi-Wen Zhang
exaly
Fixed or Dynamic Priority? That is the Question
25th IEEE International Real-Time Systems Symposium, 2004D. Mosse +6 more
openaire +1 more source
On the complexity of fixed-priority scheduling of periodic, real-time tasks
Performance Evaluation, 1982Jennifer Whitehead, Joseph Y -T Leung
exaly