【摘要】介紹了一種區(qū)分任務類型的負載平衡算法。在該算法中，按照占用的系統(tǒng)資源狀況，任務被劃分成若干類型。調度時，各節(jié)點的負載依照待調度任務的任務類型和當前系統(tǒng)資源的負載動態(tài)計算，并依照計算結果在系統(tǒng)的一個子集范圍內尋找適合解。該算法可以避免因為信息延遲造成的群聚效應，并可以滿足少量對響應時間有特殊規(guī)定的任務的需求,已經用于自主設計的分布式操作系統(tǒng)DPOS，效果良好。
關 鍵 詞 負載平衡; 區(qū)分任務類型; 分布式系統(tǒng); 調度; 群聚效應波

We present a novel load-balancing algorithm to the distributed system. In the algorithm, tasks are classified by the resource which they would take up later. While scheduling, every node’s load is calculated dynamically through the task type and the resource’s overhead collected periodically. Then a suitable node is found to the task in a subset of the whole nodes. The algorithm can remove the herd effect caused by delayed information, and can decrease the mean response time of a few tasks that have special requirement in this regard. It has been adopted in a distributed operation system developed by our group.