Sökning: "Task-Splitting Algorithms"
Hittade 1 avhandling innehållade orden Task-Splitting Algorithms.
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
Resultatsidor:
1