摘要

To solve the problem of completing the tasks within the possibly shortest time, and fully using the network resources, a bi-level programming model for optimal task scheduling based on divisible load theory is proposed. Taking into account of the rationality of task scheduling in inter-cluster and intra-cluster simultaneously, the optimal solution for the ratio of tasks allocated from SINK node of cluster head to tasks allocated from cluster head to normal nodes is obtained, and the closed-form solution for the shortest time required by finishing the application is given. Finally, the simulation results show the correctness of the theoretical analysis.

全文