首页> 外文期刊>Parallel Computing >A distributed Key Message algorithm to optimize the communication in clusters
【24h】

A distributed Key Message algorithm to optimize the communication in clusters

机译:一种分布式密钥消息算法,用于优化集群中的通信

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

摘要

The Key Message (KM) approach prioritizes communications along the critical path to speed up the execution of parallel applications in a cluster environment. However, the current KM approaches (i.e, the Static KM (SKM) and the dynamic KM with a central predictor (CDKM)) either lack the capability of adapting to dynamic environment or suffer from the expensive centralized control to predict dynamic critical path rendering them to be subop-timal.rnIn this paper, we introduce a dynamic and distributed KM algorithm (DDKM) that takes this dynamic nature into account while avoiding overheads of central control, thus, overcoming the drawbacks of its predecessors. To evaluate the DDKM algorithm, we implement it and simulate it in a cluster environment whose communication network (e.g., shared bus) can be modeled as an M/D/1. We compare DDKM with current KM approaches. The performance of DDKM is close to that of CDKM, and much better than SKM up to 28.9% when the network is highly congested. These results demonstrate that DDKM is a promising optimization in a real cluster environment.
机译:关键消息(KM)方法优先考虑沿关键路径的通信,以加快集群环境中并行应用程序的执行速度。但是,当前的KM方法(即静态KM(SKM)和带有中央预测器的动态KM(CDKM))缺乏适应动态环境的能力,或者遭受昂贵的集中控制来预测呈现它们的动态关键路径在本文中,我们介绍了一种动态分布式KM算法(DDKM),该算法考虑了这种动态特性,同时又避免了中央控制的开销,从而克服了其前身的弊端。为了评估DDKM算法,我们在一个集群环境中对其进行了实现并对其进行了仿真,该集群的通信网络(例如共享总线)可以建模为M / D / 1。我们将DDKM与当前的KM方法进行了比较。当网络高度拥塞时,DDKM的性能接近CDKM,并且比SKM更好,高达28.9%。这些结果表明,DDKM在实际集群环境中是很有前途的优化。

著录项

  • 来源
    《Parallel Computing》 |2009年第7期|401-415|共15页
  • 作者

    Yang Wang; Ming Zhu; Hua Li;

  • 作者单位

    Dept. of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2E8;

    Oracle Corporation, 500 Oracle Pkwy, Redwood City, CA 94065, USA;

    Dept. of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, Canada T1K 3M4;

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

    cluster computing; dynamic and distributed computing; priority queue; critical path; M/D/1;

    机译:集群计算;动态和分布式计算;优先队列;关键路径;M / D / 1;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号