The MSP.RTL real-time scheduler synthesis tool

MSP.RTL is a tool for producing real time schedulers for a wide variety of timing constraints. The input to MSP.RTL can be customized for different application domains, as long as their timing semantics can be expressed in RTL (real time logic). The scheduler synthesis algorithm treats the real time scheduling problem as a temporal constraint satisfaction problem with additional resource constraints. The current version of MSP.RTL computes cyclic schedules for multiprocessor systems in a three part process: the first part constructs a temporal constraint graph representing the input timing specification. The second part finds a set of solutions of the temporal constraint graph by using a combination of constraint satisfaction and an incremental positive cycle detection algorithm. The third part searches the set of solutions to find a feasible schedule which satisfies the resource constraints by exploiting search strategies and results from real time scheduling theory. We have used the MSP.RTL tool to solve same benchmark problems including a sanitized version of the Boeing 777 Integrated Airplane Information Management System (AIMS)