Heterogeneous earliest finish time (HEFT) is a heuristic algorithm to schedule a set of dependent tasks onto a network of heterogenous workers taking communication time into account. For inputs HEFT takes a set of tasks, represented as a directed acyclic graph, a set of workers, the times to execute each task on each worker, and the times to communicate the results from each job to each of its children between each pair of workers. It descends from list scheduling algorithms.
Algorithm HEFT executes in two phases.
Prioritizing tasks In the first phase each task is given a priority. The priority of each task n i {\displaystyle n_{i}} is usually designated to be its "upward rank" which is defined recursively as follows
r a n k u ( n i ) = w i ¯ + max n j ∈ s u c c ( n i ) ( c i , j ¯ + r a n k u ( n j ) ) {\displaystyle rank_{u}(n_{i})={\overline {w_{i}}}+\max _{n_{j}\in succ(n_{i})}({\overline {c_{i,j}}}+rank_{u}(n_{j}))}
where n i {\displaystyle n_{i}} represents the i t h {\displaystyle i^{th}} task, w i ¯ {\displaystyle {\overline {w_{i}}}} is an average computation cost of job i among all the processor, s u c c ( n i ) {\displaystyle succ(n_{i})} is the set of all jobs that immediately depend on task n i {\displaystyle n_{i}} , and c i , j ¯ {\displaystyle {\overline {c_{i,j}}}} is the average communication cost of the variables transferred between jobs n i {\displaystyle n_{i}} and n j {\displaystyle n_{j}} between all pairs of workers. Note that the computation of r a n k u ( n i ) {\displaystyle rank_{u}(n_{i})} depends on the computation of the rank of all its children. The upward rank is meant to represent the expected distance of any task from the end of the computation. For averaged quantities like w i ¯ {\displaystyle {\overline {w_{i}}}} different averages may provide different results.
Assigning tasks to workers In the second phase tasks are assigned to workers. Now that all tasks are prioritized we consider and schedule each one, starting with the highest priority. The task with the highest priority for which all dependent tasks have finished is scheduled on the worker which will result in the earliest finish time of that task. This finish time depends on the communication time to send all necessary inputs to the worker, the computation time of the task on the worker, and the time when that processor becomes available (it may be busy with another task). HEFT uses an insertion-based policy that fills sufficiently sized gaps between already scheduled tasks.
Discussion HEFT is well respected among heuristic algorithms for this problem. But in complex situations it can easily fail to find the optimal scheduling. HEFT is essentially a greedy algorithm and incapable of making short-term sacrifices for long term benefits. Some improved algorithms based on HEFT look ahead to better estimate the quality of a scheduling decision can be used to trade run-time for scheduling performance.
Code HEFT implementations are available on GitHub in the programming languages C++, and Python.
References
