首页> 外文会议>IEEE International Symposium on Parallel Distributed Processing >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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号