【24h】

SELF-ORGANIZING SCHEDULING ON THE ORGANIC GRID

机译:在有机网格上进行自组织调度

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

摘要

The Organic Grid is a biologically inspired and fully decentralized approach to the organization of computation that is based on the autonomous scheduling of strongly mobile agents on a peer-to-peer network. Through the careful design of agent behavior, the emerging organization of the computation can be customized for different classes of applications. In this paper, we report on our experience in adapting the general framework to run two representative applications on our Organic Grid prototype: the National Center for Biotechnology Information (NCBI) basic local alignment search tool (BLAST) code for sequence alignment, and the Cannon's algorithm for matrix multiplication. The first is an example of independent task application, a type of application commonly used for grid scheduling research because of its easily decomposable nature and absence of intra-node communication. The second is a popular block algorithm for parallel matrix multiplication, and represents a challenging application for grid platforms because of its highly structured and synchronous communication pattern. Agent behavior completely determines the way computation is organized on the Organic Grid. We intentionally chose two applications at opposite ends of the distributed computing spectrum having very different requirements in terms of communication topology, resource use, and response to faults. We detail the design of the agent behavior and show how the different requirements can be satisfied. By encapsulating application code and scheduling functionality into mobile agents, we decouple both computation and scheduling from the underlying grid infrastructure. In the resulting system, every node can inject a computation onto the grid; the computation naturally organizes itself around available resources.
机译:有机网格是一种受生物学启发且完全分散的方法,用于组织计算,该方法基于对等网络上强移动代理的自主调度。通过仔细设计代理行为,可以为不同类别的应用程序定制新兴的计算组织。在本文中,我们报告了我们在适应通用框架以在有机网格原型上运行两个代表性应用程序方面的经验:用于序列比对的美国国家生物技术信息中心(NCBI)基本本地比对搜索工具(BLAST)代码以及Cannon的矩阵乘法的算法。第一个是独立任务应用程序的示例,这是一种常用于网格调度研究的应用程序,因为它具有易于分解的特性并且不存在节点内通信。第二种是流行的用于并行矩阵乘法的块算法,由于其高度结构化和同步的通信模式,因此在网格平台上具有挑战性。代理行为完全决定了有机网格上组织计算的方式。在通信拓扑,资源使用和对故障的响应方面,我们有意选择了在分布式计算频谱相对两端的两个应用程序,它们具有非常不同的要求。我们将详细介绍代理行为的设计,并说明如何满足不同的要求。通过将应用程序代码和调度功能封装到移动代理中,我们将计算和调度与底层网格基础结构分离。在生成的系统中,每个节点都可以将计算注入到网格中。计算自然会围绕可用资源进行组织。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号