MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
|
Generates a random "worst-case" MC instance. More...
Static Public Member Functions | |
static List < CMixedCriticalityInstance > | generate (string instanceNamePrefix, int instanceCount, int numberOfClusters, double clusterMakespan) |
Generates a random "worst-case" MC instance.
A solution to each generated MC instance corresponds to a (some) solution of the 3-Partition Problem.
static List<CMixedCriticalityInstance> MCScheduling.MixedCriticality.CWorstCaseMixedCriticalityInstanceGenerator.generate | ( | string | instanceNamePrefix, |
int | instanceCount, | ||
int | numberOfClusters, | ||
double | clusterMakespan | ||
) | [static] |
instanceNamePrefix | The prefix of the generated instances names. |
instanceCount | The number of MC instances to generate. |
numberOfClusters | The number of corresponding 3-partitions, i.e. 4-times the number of MC jobs will be generated per instance. |
clusterMakespan | The sum of each partition, i.e., the maximum available execution time for the MC jobs in each cluster. |
A pseudo-random number generator.