MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
Classes | Public Member Functions
MCScheduling.MixedCriticality.SA.CMixedCriticalitySimulatedAnnealing.CPerturber Class Reference

The perturber used to change one state into one of its "neighbouring" state. More...

Inheritance diagram for MCScheduling.MixedCriticality.SA.CMixedCriticalitySimulatedAnnealing.CPerturber:
MCScheduling.SimulatedAnnealing.IPerturber< T >

List of all members.

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.

Detailed Description

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.


Constructor & Destructor Documentation

MCScheduling.MixedCriticality.SA.CMixedCriticalitySimulatedAnnealing.CPerturber.CPerturber ( CMixedCriticalityInstance  instance,
IRandomizer  randomizer 
)

The mixed-criticality instance associated with the perturbed state.

Parameters:
instanceThe mixed-criticality instance associated with states being perturbed.
randomizerThe random number generator.

Member Function Documentation

void MCScheduling.MixedCriticality.SA.CMixedCriticalitySimulatedAnnealing.CPerturber.perturb ( CSimulatedAnnealingState  state)

Moves randomly from the specified state to a neighbouring state.

Parameters:
stateThe current state to move from.
 All Classes Namespaces Functions Variables Properties