-
Assume some network topologies
-
Randomly assign tasks to nodes
-
Include a notion of task arrival pattern
-
v1 task arrival pattern -- all tasks start at t=0 and never end
Task arrival pattern is defined by:
{taskID, required CPU, required memory, required bandwidth, task duration, task start time}
Output of data generator is 3 * 5 CSV files.
As specified in #4
We have 5 entities:
- task
- node
- edge
- (task, node)
- (task, edge)
We have 3 raw metrics:
Assume some network topologies
Randomly assign tasks to nodes
Include a notion of task arrival pattern
v1 task arrival pattern -- all tasks start at t=0 and never end
Task arrival pattern is defined by:
{taskID, required CPU, required memory, required bandwidth, task duration, task start time}Output of data generator is 3 * 5 CSV files.
As specified in #4
We have 5 entities:
We have 3 raw metrics: