MART: Dynamic Scheduling for Periodic Real-Time Tasks by Adjusting Task Timing Characteristics.
Naoko Kosugi, Mario Tokoro · International journal of mini & microcomputers · 1996
This paper proposes a new scheduling algorithm, MART (Modification and Adjustment of Real-time Tasks), which can solve three problems for real-time scheduling. First, it can deal with two dynamic task changes: changes in the number of tasks and changes in task-timing characteristics. Second, it can keep the schedulability of all tasks by adjusting task periods when the system becomes overloaded due to the dynamic modifications mentioned above. Third, MART is similar to online scheduling algorithms, but it can analyze in advance the schedulability of a task set that should be scheduled. Therefore, using MART we can construct flexible systems that can adapt to a dynamically changing environment. MART is based on a well-established rate-monotonic scheduling algorithm, so the method of adjustment is easy and clear. The performance of the MART algorithm is supported by results from simulations.