You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
TCL code that implement left edge algorithm for sharing resources, after the scheduling process of a DFG.
3
+
4
+
The inputs are two lists:
5
+
- The schedule list, which is a list of lists where each sub-element is formatted in this way: {name ST res_id} (node id, starting time, resource id associated)
6
+
- The resources list, which is a list of lists, that contain all the resources used in the schedule, where each sub-element is formatted in this way: {res_id delay}
7
+
8
+
The output is a list of list where each sub-elemen has 2 parameters, the type of resources and how many are needed.
0 commit comments