GCLP Algorithm
Step1: GC is computed as the given procedure
Step2: set of ready nodes computed whose predecessors have been mapped.
Step3: selection of nodes are made from critical path (step5). Since the execution time is unknown at this point, effective execution time is determined here. It is assumed that a node is mapped to hardware with probability GC and to software with probability (1-GC).
Step4: compute longest path based on the above effective execution time.
Step5: select a node from estimated critical path.
Step6: Mapping and schedule are determined
- Use of extremity/repeller to modify the threshold. Use of weight factors vary the extremity/repeller measures.