125 random task-graphes for multiprocessor task scheduling

For a fair evaluation, a set of 125 random task-graphs for multiprocessor task scheduling are presented in this data-set. We have the following three major parameters to differentiate the shape and structure of these randomly generated task-graphs: • Size (n): The first and most contributing parameter that is the number of nodes in the given task graph. We consider five different values as {32, 64, 128, 256, and 512}. • Communication-to-Computation Ratio (CCR): Another important parameter which present us how much a graph is communication or computation intensive. All the nodes’ weights were randomly chosen from a uniform distribution with mean equal to 50 time-instance, and all the edges’ weights are randomly selected from a uniform distribution with mean equal to average-computation-cost * CCR. We consider five different values of CCR as {0.1, 0.5, 1.0, 5.0, and 10.0}, where selecting 0.1 makes the graph highly computation-intensive while 10.0 makes it highly communication-intensive. • Parallelism: Third important parameter that is the average number of children for each task in the task-graph which contributes to the connectivity of the resulted task-graph. The higher parallelism, the higher connected graph. We considered five different values of parallelism as {3, 5, 10, 15, and 20}