Table 1: Specific terms and their usage for the CEFT algorithm.

Execution cost of a node using processor
Communication cost from node to , if has been assigned to node and is assigned to node
Possible start time of node which is assigned the processor with the node being any predecessor of which has already been scheduled
Finish time of node using processor
Actual finish time of node
Finish time of the constrained critical path when processor is assigned to it
Availability time of
Set of predecessors of node
Set of successors of node
Average execution cost of node