Distributed algorithms for partially clairvoyant dispatchers

Summary form only given. Real-time systems are finding use in complex and dynamic environments such as cruise controllers, life support systems, nuclear reactors, etc., These systems have separate components that sense, control and stabilize the environment towards achieving the mission or target. These consociate components synchronize, compute and control themselves locally or have a centralized component to do the above. Distributed computing techniques improve the overall performance and reliability of large real-time systems with spread components. We propose and evaluate three distributed dispatching algorithms for partially clairvoyant schedules. For a job set of size n, the algorithms have dispatch times of O(1) per job. In the first algorithm, one processor executes all the jobs and other processors compute the dispatch functions. This scenario simplifies design and is better in situations where one processor controls all the devices. For the other algorithms, all the processors execute jobs assigned to them and compute the dispatch functions in a certain defined order; which is a plausible scenario in distributed controlling. We create various test-cases to test the algorithms due to the unavailability of benchmarks.