Using GASA to solve distributed real-time scheduling problems
Wei Pu, Yiren Zou · 2003
In addition to constraints of timing and resources, the constraints of precedence must be considered in a distributed real-time system. The scheduling problem is an NP-complete problem. The paper presents scheduling model based on the precedence graph. Based on this model, we design the rules of coding, decoding and fitness function, etc., and construct a scheduling table that meets all the constraints with the genetic algorithm and simulated annealing (GASA). With this table, distributed real-time systems can schedule tasks without jittery. An example of the Foundation fieldbus system is given to illustrate the effectiveness and feasibility of our proposed algorithm.