摘要
在网格计算中 ,一个好的管理系统应有出色的算法来调度用户提交的任务。前人基于不同目的已设计了各种调度算法 ,但通常不易施行。重点考虑工作完成时间和所耗费用 ,给出确定的模型以调度独立的任务。通过恰当的建模 ,所求解的问题将演变成 0 - 1规划问题 ,而这种问题清晰明了 ,且有现成算法求解 ,从而使得时间和费用最小化。
In grid computation, a good management system should have an excellent algorithm to schedule the tasks submitted by users. Many people have explored various algorithms for scheduling based on different goals; however, many of these models are not easy to implement. Focusing on both the job completion time and the cost of the tasks, an explicit model to schedule independent tasks was presented. The model can minimize the time and cost through an optimization method that could be implemented easily. With proper modeling, the scheduling problem was reduced to a Binary-Integer Programming (BIP) problem, which is clear and explicit, and can be solved by some ready-made methods. An example shows the validity of this algorithm.
出处
《计算机应用》
CSCD
北大核心
2004年第8期94-97,共4页
journal of Computer Applications
关键词
网格
调度
资源管理
优化
grid
scheduling
resource management
optimization
