loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Seventh IEEE Workshop on Future Trends of Distributed Computing Systems
Routing A Class of Concatenated Omega Networks
Tunisia, South Africa
December 20-December 20
ISBN: 0-7695-0468-X
Bene? networks are known to be nonblocking rearrangeable networks which can realize arbitrary permutations. Topological equivalence extends the nonblocking rearrangeability to a class of multistage interconnection net-works (MIN), which has the same topology as Bene? networks.There is another class of well-known multistage interconnection networks, which is not yet known as either nonblocking rearrangeable networks or blocking networks, such as omega+omega networks. In this paper, we extends the labeling scheme used in Bene?-equivalent networks to a class of concatenated omega networks with modified central stage connection. The class of concatenated omega networks are proved to be nonblocking rearrangeable. A looping algorithm is proposed to routing through the networks to realize arbitrary permutation for the whole class of 2log2 N stage networks.
Index Terms:
Bene? networks, topological equivalence, labeling scheme, omega + omega networks
Citation:
Linjiang Ma, Tse-Yun Feng, "Routing A Class of Concatenated Omega Networks," ftdcs, pp.29, The Seventh IEEE Workshop on Future Trends of Distributed Computing Systems, 1999
Usage of this product signifies your acceptance of the Terms of Use.