Andere Kunden interessierten sich auch für
![FAULT-TOLERANT REAL-TIME SCHEDULING FOR MULTIPROCESSOR SYSTEMS]( "FAULT-TOLERANT REAL-TIME SCHEDULING FOR MULTIPROCESSOR SYSTEMS")
FAULT-TOLERANT REAL-TIME SCHEDULING FOR MULTIPROCESSOR SYSTEMS44,99 €![Enhancement in Performance of LLF Real-Time Scheduling Algorithm]( "Enhancement in Performance of LLF Real-Time Scheduling Algorithm")
Enhancement in Performance of LLF Real-Time Scheduling Algorithm36,99 €![A Novel Approach For Scheduling]( "A Novel Approach For Scheduling")
A Novel Approach For Scheduling26,99 €![Operating System]( "Operating System")
Operating System50,99 €![Embedded Co-Design for Real Time Operating System]( "Embedded Co-Design for Real Time Operating System")
Embedded Co-Design for Real Time Operating System23,99 €![Real-time task scheduling modeling using Mixed-integer Programming]( "Real-time task scheduling modeling using Mixed-integer Programming")
Real-time task scheduling modeling using Mixed-integer Programming32,99 €![Scheduling Independent Tasks]( "Scheduling Independent Tasks")
Scheduling Independent Tasks26,99 €
Hierarchical scheduling provides predictable timing and temporal isolation; two properties desirable in real-time embedded systems. In hierarchically scheduled systems, subsystems should receive a sufficient amount of CPU resources in order to be able to guarantee timing constraints of its internal parts (tasks). In static systems, an exact amount of CPU resource can be allocated to a subsystem. However, in dynamic systems, where execution times of tasks vary considerably during run-time, it is desirable to give a dynamic portion of the CPU given the current load situation. In this thesis we present a feedback control approach for adapting the amount of CPU resource that is allocated to subsystems during run-time such that each subsystem receives sufficient resources while keeping the number of deadline violations to a minimum. We also show some example simulations where the controller adapts the budget of a subsystems.