...
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Dynamic Optimization of Multiattribute Resource Allocation in Self-Organizing Clouds
【24h】

Dynamic Optimization of Multiattribute Resource Allocation in Self-Organizing Clouds

机译:自组织云中多属性资源分配的动态优化

获取原文
获取原文并翻译 | 示例
           

摘要

By leveraging virtual machine (VM) technology which provides performance and fault isolation, cloud resources can be provisioned on demand in a fine grained, multiplexed manner rather than in monolithic pieces. By integrating volunteer computing into cloud architectures, we envision a gigantic self-organizing cloud (SOC) being formed to reap the huge potential of untapped commodity computing power over the Internet. Toward this new architecture where each participant may autonomously act as both resource consumer and provider, we propose a fully distributed, VM-multiplexing resource allocation scheme to manage decentralized resources. Our approach not only achieves maximized resource utilization using the proportional share model (PSM), but also delivers provably and adaptively optimal execution efficiency. We also design a novel multiattribute range query protocol for locating qualified nodes. Contrary to existing solutions which often generate bulky messages per request, our protocol produces only one lightweight query message per task on the Content Addressable Network (CAN). It works effectively to find for each task its qualified resources under a randomized policy that mitigates the contention among requesters. We show the SOC with our optimized algorithms can make an improvement by 15-60 percent in system throughput than a P2P Grid model. Our solution also exhibits fairly high adaptability in a dynamic node-churning environment.
机译:通过利用提供性能和故障隔离的虚拟机(VM)技术,可以按需以细粒度,多路复用的方式(而不是单片)提供云资源。通过将志愿者计算集成到云体系结构中,我们可以设想形成一个巨大的自组织云(SOC),以挖掘Internet上尚未开发的商品计算能力的巨大潜力。对于每个参与者都可以自主充当资源使用者和提供者的新架构,我们提出了一种完全分布式的VM复用资源分配方案来管理分散的资源。我们的方法不仅使用比例共享模型(PSM)实现了最大的资源利用率,而且还提供了可证明和自适应的最佳执行效率。我们还设计了一种新颖的多属性范围查询协议,用于定位合格的节点。与通常每个请求生成大量消息的现有解决方案相反,我们的协议在内容可寻址网络(CAN)上每个任务仅生成一个轻量级查询消息。它可以有效地为每个任务找到一种可以减轻请求者之间争用的随机策略下合格的资源。我们证明,采用优化算法的SOC可以比P2P Grid模型的系统吞吐量提高15-60%。我们的解决方案在动态节点引导环境中也显示出相当高的适应性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号