首页> 外文会议>2010 IEEE International Symposium on Parallel amp; Distributed Processing (IPDPS) >Service and resource discovery in cycle-sharing environments with a utility algebra
【24h】

Service and resource discovery in cycle-sharing environments with a utility algebra

机译:具有实用程序代数的周期共享环境中的服务和资源发现

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The Internet has witnessed a steady and widespread increase in available idle computing cycles and computing resources in general. Such available cycles simultaneously allow and foster the increase in development of existing and new computationally demanding applications, driven by algorithm complexity, intensive data processing, or both. Available cycles may be harvested from several scenarios, ranging from college or office LANs, cluster, grid and utility or cloud computing infrastructures, to peer-to-peer overlay networks. Existing resource discovery protocols have a number of shortcomings for the existing variety of cycle sharing scenarios. They either (i) were designed to return only a binary answer stating whether a remote computer fulfills the requirements, (ii) rely on centralized schedulers (or coherently replicated) that are impractical in certain environments such as peer-to-peer computing, (iii) they are not extensible as it is impossible to define new resources to be discovered and evaluated or new ways to evaluate them. In this paper we present a novel, extensible, expressive, and flexible requirement specification algebra and resource discovery middleware. Besides standard resources (CPU, memory, network bandwidth,...), application developers may define new resource requirements and new ways to evaluate them. Application programmers can write complex requirements (that evaluate several resources) using fuzzy logic operators. Each resource evaluation (either standard or specially coded) returns a value between 0.0 and 1.0 stating the capacity to (partially) fulfill the requirement, considering client-specific utility depreciation (i.e., partial-utility, a downgraded measure of how the user assesses the available resources) and policies for combined utility evaluation. By comparing the values obtained from the various hosts, it is possible to precisely know which ones best fulfill each client's needs, regarding a set of required resources.
机译:总体上,互联网已经见证了可用的空闲计算周期和计算资源的稳定而广泛的增长。在算法复杂性,密集数据处理或两者的共同驱动下,此类可用周期同时允许并促进现有和新的计算需求型应用程序的开发。可用的周期可以从几种情况中获得,从大学或办公室的LAN,集群,网格和公用事业或云计算基础设施到对等覆盖网络。对于现有的各种周期共享方案,现有的资源发现协议具有许多缺点。它们要么(i)仅设计为返回一个二进制答案,说明远程计算机是否满足要求;(ii)依赖于集中式调度程序(或一致地复制),这些调度程序在某些环境下(例如对等计算)不可行,( iii)它们是不可扩展的,因为不可能定义要发现和评估的新资源或评估它们的新方法。在本文中,我们提出了一种新颖,可扩展,可表达且灵活的需求规范代数和资源发现中间件。除了标准资源(CPU,内存,网络带宽等)之外,应用程序开发人员还可以定义新的资源需求和评估它们的新方法。应用程序员可以使用模糊逻辑运算符编写复杂的需求(评估多个资源)。每种资源评估(标准或特殊编码)返回的值介于0.0到1.0之间,表示(部分地)满足要求的能力,同时考虑了特定于客户的实用程序折旧(即部分实用程序,即用户评估性能的降级度量)。可用资源)和用于公用事业评估的政策。通过比较从各种主机获得的值,就一组必需的资源而言,可以精确地知道哪一个最能满足每个客户的需求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号