MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
|
Contains the implementation of a mixed-criticality solver based on the dynamic programming algorithm (similar to the one solving the traveling salesman problem). More...
Classes | |
class | CDPSolver |
An dynamic programming type algorithm for solving mixed-criticality scheduling problems of minimal size. More... |
Contains the implementation of a mixed-criticality solver based on the dynamic programming algorithm (similar to the one solving the traveling salesman problem).