Sökning: "Hard real-time Scheduling"
Visar resultat 1 - 5 av 39 avhandlingar innehållade orden Hard real-time Scheduling.
1. Preemption-Delay Aware Schedulability Analysis of Real-Time Systems
Sammanfattning : 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 due to the inherent over-approximation of many time-related parameters such as task execution time, system delays, etc. LÄS MER
2. Automatic memory management for flexible real-time systems
Sammanfattning : In a flexible real-time system, the constraints in available CPU time and memory lead to resource management problems, which must be handled carefully in order to maximize quality of service while avoiding overload. Managing CPU time -- scheduling -- is well studied and dynamic scheduling is widely accepted in the real-time industry. LÄS MER
3. Real-Time Communication Services for Distributed Computing over Switched Ethernet
Sammanfattning : In modern and future parallel and distributed processing, a large part of computation overhead comes from communication. This can be minimized if the network protocol offers the user services that are aimed at specific types of communication used in these applications. LÄS MER
4. Scheduling and Communication Synthesis for Distributed Real-Time Systems
Sammanfattning : Embedded systems are now omnipresent: from cellular phones to pagers, from microwave ovens to PDAs, almost all the devices we use are controlled by embedded systems. Many embedded systems have to fulfill strict requirements in terms of performance and cost efficiency. LÄS MER
5. Towards the Integration of Control and Real-Time Scheduling Design
Sammanfattning : The thesis deals with scheduler and controller co-design for real-time control systems. The overall goal is higher resource utilization and better control performance. One goal is to minimize the performance loss due to jitter and control delays. LÄS MER