Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

作     者：Touzene, A 

作者机构：Sultan Qaboos Univ Coll Sci Dept Comp Sci Muscat 123 Oman 

出 版 物：《PARALLEL COMPUTING》 (并行计算)

年 卷 期：2002年第28卷第4期

页      面：649-666页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：interconnection networks broadcasting algorithms fault tolerance spanning trees butterfly networks 

摘      要：In many parallel applications, the need for broadcasting, scattering, gathering or gossiping is crucial. Many collective communication algorithms have been studied for different topologies of interconnection networks such as hypercubes, meshes, De Bruijn and star graphs, In this paper we study some communication procedures on the binary wrapped butterfly BWB(n) of dimension n interconnection networks. We consider the BWB(n) as a point-to-point interconnection network. Communication is assumed to be full duplex, all-ports with a linear communication model and is based on store-and-forward techniques. The BWB(n) is a constant degree 4 Cayley graph. Vadapalli and Srimani gave a new representation of the BWB(n) that bring some convenience in studying the topological properties and fault tolerance. Using this new representation, we propose an improved one-to-all broadcast algorithm, based on a spanning tree of optimal height. We present a technique based on rotative trees for constructing multiple spanning trees that would be used to derive: a fault tolerant one-to-all broadcast, a scattering, a gathering algorithms and theirs fault tolerant version. (C) 2002 Elsevier Science B.V. All rights reserved.