Balancing Traffic Load for Multi-Node Multicast in Wormhole 2D Tori/Meshes and Irregular Networks

• Main Authors: Ching-Sung Shiu, 徐慶松
• Other Authors: Yu-Chee Tseng
• Format: Others
• Language: zh-TW
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/32613812721322477184

碩士 === 國立中央大學 === 資訊工程研究所 === 87 === In a multicomputer network, processors often need to communicate with each other for various reasons, such as data exchange and event synchronization. Efficient communication is critical for high-performance computing in MPPs. This is especially true for those collective communication patterns, such as broadcast and multicast, which involve more than one source and/or destination. This paper considers the multi-node multicast problem in a wormhole-routed 2D torus/mesh, where an arbitrary number of source nodes each intending to multicast a message to an arbitrary set of destinations. To resolve the contention and the congestion problems, we propose to partition the network into subnetworks to distribute, and thus balance, the traffic load among all network links. Several ways to partition the network are explored. Simulation results show significant improvement over existing results for torus and mesh networks. More recently, high speed switches and network equipment are used to connect high performance PC or workstations to build a high speed and performance distributed computing environment called NOWs(Network of Workstations). From our previous researches, the network partition schemes have some kind of improvements better than others algorithm on some collective communications in regular networks. In this paper we will show how to use the concept of "network partition scheme" on NOWs environment. And we hope that the idea "network partition scheme", will also have some improvement on NOWs environment.