An architecture to support cooperating mobile embedded systems
Proceedings of the 1st conference on Computing frontiers
| Hi-index | 0.00 |
In this paper we introduce a robust earlist deadline scheduling algorithm for dealing with sporadic tasks under overloads in a hard real-time environment. The algorithm synergestically combines many features including a very important minimum level of guarantee, dynamic guarantees, graceful degredation in overloads, deadline tolerance, resource reclaiming, and dynamic re-guarantees. A necessary and sufficient schedulability test is presented, and an efficient 0(n) guarantee algorithm is proposed. The new algorithm is evaluated via simulation and compared to several baseline algorithms. The experimental results show excellant performance of the new algorithm in normal and overload conditions.