Optimal Scheduling in Graphical Modeling Environments

Methods for controlling execution order in traditional text-based languages such as C and Fortran are well established. The transition to graphical programs has revealed some of the hidden issues inherent in any scheduling routine, specifically data dependency and data protection (in multirate systems). Graphical programming languages provided built-in diagnostics that allow users to analyze the data dependencies to develop optimal schedules from a data propagation perspective. This paper examines one heuristic that can be used to develop an optimal schedule for an arbitrary model.