首页> 外文学位 >Decentralized and scalable resource management for desktop grids.
【24h】

Decentralized and scalable resource management for desktop grids.

机译:桌面网格的分散和可扩展的资源管理。

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

摘要

The recent growth of the Internet and the CPU power of personal computers and workstations enables desktop grid computing to achieve tremendous computing power with low cost, through opportunistic sharing of resources. However, traditional server-client Grid architectures have inherent problems in robustness, reliability and scalability. Researchers have therefore recently turned to Peer-to-Peer (P2P) algorithms in an attempt to address these issues.;I have designed and evaluated a set of protocols that implement a scalable P2P desktop grid computing system for executing Grid applications on widely distributed sets of resources. Such infrastructure must be decentralized, robust, highly available and scalable, while effectively mapping application instances to available resources throughout the system (called matchmaking ).;First of all, I address the problem of efficient matchmaking of jobs to available system resources by employing customized Content-Addressable Network (CAN) where each resource type corresponds to a distinct dimension. With this approach, incoming jobs are matched with system nodes through proximity in an N-dimensional resource space. Second, I provide comprehensive load balancing mechanisms that can greatly improve overall system throughput and response time without using any centralized control or information about the system. Finally, to remove any hot spots in the system where a small number of nodes are processing a lot of system maintenance work, I have designed a set of optimizations to minimize overall system overheads and distribute them fairly among available system nodes. My ultimate goal is to ensure that no node in the system becomes much more heavily loaded than others, either because of executing jobs or from system maintenance tasks. This is because every node in our system is a peer, so that no node is acting as a pure server or a pure client.;Throughout extensive experimental results, I show that the resulting P2P desktop grid computing system is scalable and effective so that it can efficiently match any type of resource requirements for jobs simultaneously, while balancing load among multiple candidate nodes.
机译:Internet的最新发展以及个人计算机和工作站的CPU能力使桌面网格计算能够通过机会共享资源以低成本实现巨大的计算能力。但是,传统的服务器-客户端网格体系结构在健壮性,可靠性和可伸缩性方面存在固有的问题。因此,研究人员最近转向了对等(P2P)算法,以解决这些问题。我设计并评估了一组协议,这些协议实现了可扩展的P2P桌面网格计算系统,用于在广泛分布的集合上执行Grid应用程序资源。这样的基础架构必须是分散的,健壮的,高度可用的和可伸缩的,同时有效地将应用程序实例映射到整个系统中的可用资源(称为匹配)。首先,我通过采用定制化解决了作业与可用系统资源的有效匹配的问题。内容可寻址网络(CAN),其中每种资源类型对应一个不同的维度。通过这种方法,传入作业通过N维资源空间中的邻近性与系统节点匹配。其次,我提供了全面的负载平衡机制,可以在不使用任何集中控制或有关系统的信息的情况下,极大地提高整体系统的吞吐量和响应时间。最后,为了消除少数节点正在处理大量系统维护工作的系统中的任何热点,我设计了一组优化措施,以最大程度地减少总体系统开销,并在可用系统节点之间公平地分配它们。我的最终目标是确保系统中没有节点由于执行作业或系统维护任务而变得比其他节点负载大得多。这是因为我们系统中的每个节点都是对等节点,因此没有节点充当纯服务器或纯客户端。通过广泛的实验结果,我证明了所得的P2P桌面网格计算系统具有可伸缩性和有效性,因此可以有效地同时满足作业的任何类型的资源需求,同时平衡多个候选节点之间的负载。

著录项

  • 作者

    Kim, Jik-Soo.;

  • 作者单位

    University of Maryland, College Park.;

  • 授予单位 University of Maryland, College Park.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2009
  • 页码 210 p.
  • 总页数 210
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

  • 入库时间 2022-08-17 11:38:28

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号