Research Article
Online Energy-Aware Scheduling for Deadline-Constrained Applications in Distributed Heterogeneous Systems
Table 1
The used notations in this paper.
| Notation | Implication |
| | The -th processor in the system | | The number of processors | | The -th DAG in the system | | The arrival time of DAG | | The deadline of | | The set of tasks in | | The set of edges between all tasks in | | The -th task in | | The number of tasks in | | The set of predecessors of task | | The set of successors of task | | The data transfer time between and | | The average execution time of | | The actual execution time of task on processor with frequency | | The earliest start time of | | The earliest finish time of | | The earliest time that the processor can execute a task | | Schedule completion time of | | The energy consumption of task on the processor with frequency |
|
|