首页> 外文会议>International Conference on Information Technology and Computer Science >A Grid Resource Allocation Method Based on Iterative Combinatorial Auctions
【24h】

A Grid Resource Allocation Method Based on Iterative Combinatorial Auctions

机译:一种基于迭代组合拍卖的网格资源分配方法

获取原文

摘要

Whereas grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may require multiple grid services, mechanisms such as single-good auctions may not be appropriate for the management of these services, we propose a new scheduling algorithm based on iterative combinatorial auction. We provide the design of prices announcement, agent creation and resource situation submission, bidding rules, and temporary allocation rules. A simulation environment is established based on the Gridsim toolkit and the simulation experiments indicate that the algorithm needs less communication and meet the requirements of userpsilas QoS better than the conventional algorithms.
机译:虽然网格启用了地理分布式资源的共享,选择,查询和聚合,以解决大规模问题,提供管理网格资源的有效资源分配机制是复杂的事业。在这项工作中,我们考虑了作为采购计算和数据资源的代理的工程代理问题。由于应用程序可能需要多个网格服务,因此单个良好的拍卖机制可能不适合于管理这些服务,我们提出了一种基于迭代组合拍卖的新调度算法。我们提供价格公告,代理商创作和资源情况提交,竞标规则和临时分配规则的设计。基于Gridsim Toolkit建立了模拟环境,仿真实验表明该算法需要较少的通信并满足比传统算法更好的userpsilas QoS的要求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号