首页> 外文会议>2010 International Conference on Computer Application and System Modeling >Credible resource scheduling on the minimum opportunity cost in grid
【24h】

Credible resource scheduling on the minimum opportunity cost in grid

机译:在网格中以最小机会成本进行可靠的资源调度

获取原文

摘要

Dynamic changes of grid entities can result in security problems in the grid environment and in efficient use of resources. Resource provider may maliciously exaggerate resource performance and unilaterally contract termination. The original deadline and budget constraint method for resource scheduling is not suitable for unreliable environment. By employing trust mechanism into grid environment, a minimum opportunity cost(MOC) algorithm was for resource scheduling to bridge this gap. This algorithm first filters most of the lower-trust resources basing on user's trust demand. Then in the light of the high price and risk factors of the remained reliability resources, it chooses the optimal resources of minimum cost. Simulation results show that the algorithm gives two-fold incentives. It effectively guarantees profit of reliable resource provider, and reduces job failure rate and cost of user.
机译:网格实体的动态更改可能会导致网格环境中的安全性问题以及资源的有效利用。资源提供者可能恶意夸大资源性能并单方面终止合同。最初用于资源调度的期限和预算约束方法不适用于不可靠的环境。通过将信任机制应用到网格环境中,最小机会成本(MOC)算法用于资源调度以弥合这一差距。该算法首先根据用户的信任需求过滤掉大部分低信任度资源。然后,根据高价和剩余可靠性资源的风险因素,选择成本最低的最优资源。仿真结果表明,该算法具有两个方面的诱因。它有效地保证了可靠的资源提供者的利润,并降低了工作失败率和用户成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号