GC procedure explaination
Priority function(Pf):
- rank the nodes in order of decreasing software execution time tsi or
- use tsi /thi as function to rank the nodes. (greatest relative gain in time when moved to hardware) BEST RESULT
- rank in increasing order of ahi (nodes with smaller hardware area are moved out of software first)
The finish time is computed by an O(|A|+|N|) algorithm. One can know if the set of nodes are feasible to move to hardware. If not, more nodes are required to move by repeating steps 1.1 to 1.3.
GC is computed as a ratio of the sum of the sizes of the nodes in NS?H to the sum of the nodes in NU. The size of a node is taken as number of elementary operations (add,multiply, etc..) in a node.