On guaranteed task scheduling in real time distributed process control systems

Having considered various kinds of factors and many assumptions, we have developed a guaranteed task scheduling algorithm for workstations in real time distributed control systems that is mainly composed of three parts: active scheduling policy, guaranteed routine and cooperation bidding. We describe a general guaranteed task scheduling condition by birth-death process. We also analyse the influence of different demands of fault-tolerance on active scheduling policy, guaranteed routine and cooperation bidding; and we explore the performance change of guaranteed routine and cooperation bidding, given different active scheduling policies. Simulation studies are used to evaluate the performance of the algorithm, given the real time distributed process control systems composed of three workstations and six front-end controllers.<>