Abstract: Being aimed at highspeed SpaceWireD, a method of schedule generation was put forward, implemented with greedy algorithm combined with SMTSolver. The greedy algorithm was designed to generate a set of constraint for SMTSolver and to make the frames and frame chips distribute more uniformly in the generated schedule. The SMTSolver is an important tool and its function is to determine the satisfiability of input parameters. If it is satisfiable, the output module is the schedule wanted. In addition, new policies were proposed about setting the length of frame chips, the size of timeslots, and collision area division. The method was verified with experiments. The results show that the generation algorithm can acquire a schedule featured by approximate uniform distribution in hundreds of milliseconds.

Key words: SpaceWireD, schedule, satisfiability module theory, realtime communication, greedy algorithm