Distributed scheduling of tasks exempt of any timing failure

Abstract

In the design of distributed computer systems, especially real time distributed systems the scheduling problem is considered to be an important one. First, the problem of testing feasibility for a set of time critical tasks that run on each node-processor machine locally has been studied. The acceptance tests and the scheduling algorithms are described as follows: scheduling sporadic tasks within idle times; scheduling periodic tasks as late as possible; scheduling periodic and sporadic tasks together. Second, the problem of tasks which haven't been executed locally in the node is studied. There are three algorithms for cooperation to be evaluated in the distributed system: the focused addressing algorithm; the bidding algorithm; the flexible algorithm. The results show that distributed scheduling is effective in a hard real time environment.<>