The need for broadcasting or One-to-All broadcast arizes in many parallel or distributed applications. Broadcasting has been studied for many topologies of interconnection networks such as hypercubes, meshes, De Bruijn, star graphs and binary butterfly. In this paper we propose a broadcasting algorithm for the generalized butterfly GBN(d, n) interconnection networks. The generalized butterfly GBN(d,n] has recently gained some interest as a point-to-point interconnection network rather than the well known multistage butterfly networks. We consider the GBN(d, n) as a point-to-point interconnection, using store-and-forward communication. We propose a broadcasting algorithm for the GBN(d, n), based on a spanning tree of optimal height that avoids data redundancy.
展开▼
