The HEFT Algorithm Based on Node Merging

The task scheduling problem in power systems is complex, especially when communication costs exceed computation costs. This paper proposes an improved HEFT algorithm with a node merging mechanism, merging nodes through hierarchical traversal to assign high-communication-cost tasks to the same processor, reducing communication overhead. Experiments with 499-dimensional and 1614-dimensional matrices from the power system show that the improved algorithm reduces completion time by 5ms and 2ms, respectively, compared to standard HEFT.