MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
|
The perturber used to change one state into one of its "neighbouring" state. More...
Classes | |
class | LatenessComparer |
Public Member Functions | |
CPerturber (CMixedCriticalityInstance instance, IRandomizer randomizer) | |
The mixed-criticality instance associated with the perturbed state. | |
void | perturb (CSimulatedAnnealingState state) |
Moves randomly from the specified state to a neighbouring state. |
The perturber used to change one state into one of its "neighbouring" state.
Basically it works such that it randomly selects a tardy job and tries to schedule it earlier to fulfil its deadline.
MCScheduling.MixedCriticality.SA.CMixedCriticalitySimulatedAnnealing.CPerturber.CPerturber | ( | CMixedCriticalityInstance | instance, |
IRandomizer | randomizer | ||
) |
The mixed-criticality instance associated with the perturbed state.
instance | The mixed-criticality instance associated with states being perturbed. |
randomizer | The random number generator. |
void MCScheduling.MixedCriticality.SA.CMixedCriticalitySimulatedAnnealing.CPerturber.perturb | ( | CSimulatedAnnealingState | state | ) |
Moves randomly from the specified state to a neighbouring state.
state | The current state to move from. |