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).

[1]  Shimon Even,et al.  Graph Algorithms , 1979 .

[2]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[3]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[4]  Aloysius K. Mok,et al.  A Graph-Theoretic Approach for Timing Analysis and its Implementation , 1987, IEEE Transactions on Computers.

[5]  Aloysius K. Mok,et al.  Coping with Implementation Dependencies in Real-Time System Verification , 1991, REX Workshop.

[6]  Krithi Ramamritham,et al.  Allocation and scheduling of complex periodic tasks , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[7]  Luqi.  Real-Time Constraints in a Rapid Prototyping Language , 1993, Comput. Lang..

[8]  Kevin Driscoll,et al.  ARINC 659 scheduling: problem definition , 1994, 1994 Proceedings Real-Time Systems Symposium.

[9]  Theodore P. Baker,et al.  An Architecture for Real-Time Software Systems , 1989 .

[10]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[11]  Theodore P. Baker,et al.  Special Feature: An Architecture for Real-Time Software Systems , 1986, IEEE Software.

[12]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[13]  Jun Sun,et al.  Perts: a Prototyping Environment for Real-Time Systems , 1996, Int. J. Softw. Eng. Knowl. Eng..

[14]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[15]  Riccardo Bettati,et al.  PERTS: A prototyping environment for real-time systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[16]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

[17]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..