Parallel Task Scheduling |
STG Example File |
The first line tells the number of nodes (not counting entry and exit) in the file.
Every line afterwards begins with the task number. This is followed by the task cost/time. Next is the number of predecessor tasks and then a list of those tasks.
For example, line nine: Task number is 7 Task cost/time is 20 Task has 2 predecessors Predecessor list: 3 4
More details can be found at Waseda University. |
10 0 0 0 1 3 1 0 2 3 1 1 3 4 1 1 4 2 1 1 5 1 1 2 6 10 1 2 7 20 2 3 4 8 7 2 5 6 9 5 2 6 7 10 8 2 8 9 11 0 1 10 # Standard Task Graph Set Project # Application Task Graph example.stg # Application Name : example control program # Tasks : 10 (+dummy tasks : 2) # Edges : 13 (+dummy edges : 2) # Max. Predecessors : 2 # Min. Predecessors : 0 # Ave. Predecessors : 1.3 # Max. Proc. Time : 20 # Min. Proc. Time : 1 # Ave. Proc. Time : 6.2 # CP Length : x # Parallelism : y |