Skip to content

Commit 4dc73a4

Browse files
authored
Update README.md
1 parent 4ff6ae9 commit 4dc73a4

File tree

1 file changed

+6
-0
lines changed

1 file changed

+6
-0
lines changed

README.md

+6
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,8 @@
11
# Left_Edge_Algorithm
22
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

Comments
 (0)