摘要
本文介绍了网格的基本概念,着重讨论了网格环境下计算任务在地理分布的各种资源之间的动态调度。这类问题可描述为将n个相互独立的任务分配到m个异构可用资源上以获取最小的完成时间和最大的资源利用率,这是一个NP完全问题。
The paper introduces basic concepts and critical technology of grid.Then focusedon addressing the dynamic scheduling of jobs to the geographically distributed computing resources in the gird computing environment.To formulatethe problem,and consider in inde -pendent user jobs on Rm heterogeneous resources with an objective of minimizing the co-repletion time and utilizing the resources effectively.This problem is known to be NP-com-plete.
出处
《科技信息》
2009年第33期71-72,120,共3页
Science & Technology Information
关键词
网格
任务调度
网格计算
Grid
Task Scheduling
Grid Computing
