Sökning: "Rate-Monotonic Scheduling"
Hittade 4 avhandlingar innehållade orden Rate-Monotonic Scheduling.
1. Scheduling Algorithms For Fault-Tolerant Real-Time Systems
Sammanfattning : This thesis deals with the problem of designing efficient fault-tolerant real-time scheduling algorithms for independent periodic tasks on uni- and multiprocessor platforms. The well-known Rate-Monotonic (RM) scheduling algorithm is assumed as it is widely used in many commercial systems due to its simplicity and ease of implementation. LÄS MER
2. Scheduling Garbage Collection in Embedded Systems
Sammanfattning : The complexity of systems for automatic control and other safety-critical applications grows rapidly. Computer software represents an increasing part of the complexity. As larger systems are developed, we need to find scalable techniques to manage the complexity in order to guarantee high product quality. LÄS MER
3. Energy-Centric Scheduling for Real-Time Systems
Sammanfattning : Energy consumption is today an important design issue for all kinds of digital systems, and essential for the battery operated ones. An important fraction of this energy is dissipated on the processors running the application software. To reduce this energy consumption, one may, for instance, lower the processor clock frequency and supply voltage. LÄS MER
4. A Generic Approach to Schedulability Analysis of Real-Time Systems
Sammanfattning : This thesis presents a framework for design, analysis, and implementation of embedded systems. We adopt a model of timed automata extended with asynchronous processes i.e. tasks triggered by events. LÄS MER