Sökning: "scheduling anomalies"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden scheduling anomalies.
1. Insights on non-partitioned fixed-priority preemptive scheduling
Sammanfattning : .... LÄS MER
2. Techniques to Tighten the Upper Bound on the ExecutionTime of Task-based Parallel Applications
Sammanfattning : To use multiprocessors in hard real-time systems, schedulability analysis is needed to provide formally proven guarantees for the timing behavior of the system. Programming models for parallel applications, such as OpenMP, use pragmas to specify parts of the application as parallel tasks, for example, a function or a body of a loop. LÄS MER
3. Limited Preemptive Scheduling in Real-time Systems
Sammanfattning : Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when scheduling real-time tasks, mainly in the form of preemption overheads and blocking, that potentially compromise timeliness guarantees. The high preemption overheads in preemptive real-time scheduling may imply high resource utilization, often requiring significant over-provisioning, e. LÄS MER
4. Data-driven models for railway track geometry maintenance
Sammanfattning : Railways are currently experiencing higher demands on safety, infrastructure performance, network capacity and service quality, etc. As a result, a high level of track availability, service quality and infrastructure robustness against unexpected events is required, at reduced cost, to meet the demands. LÄS MER
5. Scheduling techniques to improve the worst-case execution time of real-time parallel applications on heterogeneous platforms
Sammanfattning : The key to providing high performance and energy-efficient execution for hard real-time applications is the time predictable and efficient usage of heterogeneous multiprocessors. However, schedulability analysis of parallel applications executed on unrelated heterogeneous multiprocessors is challenging and has not been investigated adequately by earlier works. LÄS MER