【24h】

Broadcast on Clusters of SMPs with Optimal Concurrency

机译:在具有最佳并发性的SMP集群上广播

获取原文

摘要

In this paper, we present a hierarchical method for broadcast on clusters of symmetric multiprocessors (CSMPs) connected by switches with one-port model. We focus on the inter-switch broadcast that forms the core part of a broadcast on CSMPs. The proposed broadcast method is based on single-source shortest path minimum-cost spanning tree (SSS-MST). Two heuristic algorithms, from-up-to-down and from-down-to-up, are proposed to achieve the maximum concurrency using the information of the underlying network topology and the costs of links. Performance evaluation is also conducted to show the superiority of the proposed methods.
机译:在本文中,我们提出了一种在通过单端口模型的交换机连接的对称多处理器(CSMP)集群上进行广播的分层方法。我们专注于交换机间广播,它是CSMP广播的核心部分。所提出的广播方法基于单源最短路径最小成本生成树(SSS-MST)。提出了两种启发式算法,从上到下和从下到上,以利用底层网络拓扑结构的信息和链接成本来实现最大的并发性。还进行了性能评估,以显示所提出方法的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号