Experiments and evaluation for the paper "DAG Scheduling and Analysis on Multiprocessor Systems: Exploitation of Parallelism and Dependency", RTSS 2020. (artifacts evaluation passed)
I found an error in TPDS_Assign_Priority. You first remove node v and its outgoing edges from G, and then you search for the successor nodes of v in G.
A = find_successor(G_copy, v)
remove_nodes_in_graph(G_copy, [v])
if v in V:
V.remove(v)
# priority assignment
Prio[v] = p[0]
p[0] = p[0] + 1
I found an error in TPDS_Assign_Priority. You first remove node v and its outgoing edges from G, and then you search for the successor nodes of v in G.