Scheduling periodic distributed hard real-time tasks

We present several efficient online and offline strategies for assigning periodic tasks to the nodes of a distributed system, such that the tasks can be feasibly scheduled by the node using some local static/dynamic priority assigning rule. We describe rules that lead to a near optimal utilization factor. Strategies are given for approximation algorithms and the approach leads to a high guarantee ratio.