...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel Computing >P2P-based resource discovery in dynamic grids allowing multi-attribute and range queries
【24h】

P2P-based resource discovery in dynamic grids allowing multi-attribute and range queries

机译：动态网格中基于P2P的资源发现允许多属性和范围查询

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

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A key point for the efficient use of large grid systems is the discovery of resources, and this task becomes more complicated as the size of the system grows up. In this case, large amounts of information on the available resources must be stored and kept up-to-date along the system so that it can be queried by users to find resources meeting specific requirements (e.g. a given operating system or available memory). Thus, three tasks must be performed, (1) information on resources must be gathered and processed. (2) such processed information has to be disseminated over the system, and (3) upon users' requests, the system must be able to discover resources meeting some requirements using the processed information. This paper presents a new technique for the discovery of resources in grids which can be used in the case of multi-attribute (e.g. [OS = Linux & memory = 4 GB}) and range queries (e.g. (50 GB ＜ disk-space ＜ 100 GB}). This technique relies on the use of content summarisation techniques to perform the first task mentioned before and strives at the main drawback found in proposals from literature using summarization. This drawback is related to scalability, and is tackled by means of using Peer-to-Peer (P2P) techniques, namely Routing Indices (RIs), to perform the second and third tasks. Another contribution of this work is a performance evaluation conducted by means of simulations of the EU DataGRID Testbed which shows the usefulness of this approach compared to other proposals from literature. More specifically, the technique presented in this paper improves on the scalability and produces good performance. Besides, the parameters involved in the summary creation have been tuned and the most suitable values for the presented test case have been found.
机译：有效利用大型网格系统的关键是发现资源，并且随着系统规模的增长，此任务变得更加复杂。在这种情况下，必须在系统上存储并保持有关可用资源的大量信息，以便用户可以查询以找到满足特定要求的资源（例如，给定的操作系统或可用内存）。因此，必须执行三个任务，（1）必须收集和处理有关资源的信息。 （2）此类处理后的信息必须在系统上分发，并且（3）根据用户的请求，系统必须能够使用处理后的信息发现满足某些要求的资源。本文提出了一种用于发现网格中资源的新技术，该技术可用于多属性（例如[OS = Linux＆memory = 4 GB}）和范围查询（例如（50 GB ＜磁盘空间＜ 100 GB}）。该技术依赖于内容摘要化技术的使用来执行前面提到的第一个任务，并努力克服文献中使用摘要化的提案中发现的主要缺陷，该缺陷与可伸缩性有关，并且可以通过使用对等（P2P）技术，即路由选择索引（RI），用于执行第二和第三项任务，这项工作的另一个贡献是通过对EU DataGRID Testbed的仿真来进行性能评估，表明了该方法的实用性与文献中的其他建议相比，本文提出的技术改进了可伸缩性并产生了良好的性能，此外，对摘要创建中涉及的参数进行了调整，并且已经找到了最适合所提出的测试用例的值。

著录项

  • 来源
    《Parallel Computing》 |2013年第10期|615-637|共23页
  • 作者

    Agustin C. Caminero; Antonio Robles-Gomez; Salvador Ros; Roberto Hernandez; Llanos Tobarra;

  • 作者单位

    Dpfo. de Sistemas de Comunkacion y Control, Universidad National de Education a Distantia, Madrid, Spain;

    ,ETSI Informatica, UNED, C/Juan del Rosal, 16. 28040 Madrid, Spain;

    Dpfo. de Sistemas de Comunkacion y Control, Universidad National de Education a Distantia, Madrid, Spain;

    Dpfo. de Sistemas de Comunkacion y Control, Universidad National de Education a Distantia, Madrid, Spain;

    Dpfo. de Sistemas de Comunkacion y Control, Universidad National de Education a Distantia, Madrid, Spain;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Resource discovery; Grids; Summarization; Routing indices; Scalability;

    机译：资源发现;网格;总结;路由索引;可扩展性;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号