摘要： 广播是大规模并行计算机中基本的通信模式之一。在全端口虫蚀寻径的超立方体上给出了一个采用E-立方体寻径的优化广播算法。该算法充分利用了虫蚀寻径的距离不敏感性以及多端口结构的特性,其性能比目前已有的各种全端口广播算法都要好,而且该算法避免了通道冲突。

关键词: 全端口, 虫蚀寻径, 超立方体, 广播算法, 通道冲突

Abstract: Broadcast is a primary communication pattern in massively parallel computers. This paper presents an optimal broadcast algorithm forall-port wormhole-routed hypercubes. By exploiting the distance-insensitive characteristic of wormhole-routing and the properties of all-portnetworks, the proposed algorithm outperforms the existing all-port broadcast algorithms significantly, and avoids channel-conflict as well.

中图分类号: 

• TP338