Bubble-Scheduling/task_graph_generator.py at master · Midren/Bubble-Scheduling · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
from graph import Node, Graph
import os, sys
from pprint import pprint

def get_graph(filename):
    graph = Graph()
    with open(filename) as f:
        lines = f.readlines()
        end = int((lines[-1]).split()[1])
        node_lst = [None for i in range(end + 1)]
        for num, line in enumerate(lines[:-1]):
            if (not line.startswith("NODE ")):
                continue
            line = line.split()
            if line[3] == 'ROOT' or line[3] == 'COMPUTATION':
                node = Node(int(line[1]), float(line[4]), float(line[5]))
                node_lst[node.index] = node
                if line[2] == str(end):
                    graph.inc_dct[node].append((end, 0))
                if line[3] == 'ROOT':
                    for ind in line[2].split(","):
                        graph.inc_dct[node].append((int(ind), 0))
            else:
                weight = float(line[4])
                node_lst[node.index] = node
                for ind in line[2].split(","):
                    graph.inc_dct[node].append((int(ind), weight))
        node_lst[end] = Node(end, float(lines[-1].split()[4]), 0)
        for nd in graph.inc_dct.keys():
            for ind in graph.inc_dct[nd][:]:
                if isinstance(ind[0], int):
                    graph.inc_dct[nd].append((node_lst[ind[0]], ind[1]))
                    graph.inc_dct[nd].remove(ind)
        graph.inc_dct[node_lst[-1]] = []
    return graph


def generate_graph_txt():
    os.system("./daggen -n 5 -o dag.txt")
    return get_graph('dag.txt')