Search for dissertations about: "Partitioned Scheduling"
Showing result 1 - 5 of 12 swedish dissertations containing the words Partitioned Scheduling.
-
1. Insights on non-partitioned fixed-priority preemptive scheduling
Abstract : .... READ MORE
-
2. Scheduling Algorithms For Fault-Tolerant Real-Time Systems
Abstract : 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. READ MORE
-
3. Preemption-Delay Aware Schedulability Analysis of Real-Time Systems
Abstract : 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. READ MORE
-
4. Partitioned Scheduling of Real-Time Tasks on Multi-core Platforms
Abstract : In recent years multiprocessor architectures have become mainstream, and multi-core processors are found in products ranging from small portable cell phones to large computer servers. In parallel, research on real-time systems has mainly focused on traditional single-core processors. READ MORE
-
5. Improving the Schedulability of Real Time Systems under Fixed Preemption Point Scheduling
Abstract : During the past decades of research in Real-Time systems, non-preemptive scheduling and fully preemptive scheduling have been extensively investigated, as well as compared with each other. However, it has been shown that none of the two scheduling paradigms dominates over the other in terms of schedulability. READ MORE