A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple-Based Chemical Reaction Optimization

Table 1

Specific terms and their usage for the CEFT algorithm.

EC𝑃𝑟(𝑤)	Execution cost of a node 𝑤 using processor 𝑃𝑟
CM(𝑤,𝑃𝑟,𝑣,𝑃𝑥)	Communication cost from node 𝑣 to 𝑤, if 𝑃𝑥 has been assigned to node 𝑣 and 𝑃𝑟 is assigned to node 𝑤
ST𝑃𝑟(𝑤,𝑣)	Possible start time of node 𝑤 which is assigned the processor 𝑃𝑟 with the 𝑣 node being any predecessor of 𝑤 which has already been scheduled
EFT𝑃𝑟(𝑤)	Finish time of node 𝑤 using processor 𝑃𝑟
AEFT𝑤	Actual finish time of node 𝑤
CEFT𝑃𝑟(CCP𝑗)	Finish time of the constrained critical path 𝑄𝑗 when processor 𝑃𝑟 is assigned to it
AT𝑃𝑟	Availability time of 𝑃𝑟
Pred(𝑤)	Set of predecessors of node 𝑤
Succ(𝑤)	Set of successors of node 𝑤
AEC(𝑤)	Average execution cost of node 𝑤