Optimally routing LC permutations on k-extra-stage cube-type networks | IEEE Journals & Magazine | IEEE Xplore

Optimally routing LC permutations on k-extra-stage cube-type networks


Abstract:

It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for all source-destination pairs in each group can be ...Show More

First Page of the Article

Abstract:

It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for all source-destination pairs in each group can be established on an omega network. Based on linear algebra theory, this paper presents an optimal algorithm which solves this problem for the LC class of permutations on a large class of multi-stage networks. This algorithm extends the previous result which deals with the BPC class of permutations on the omega network.
Published in: IEEE Transactions on Computers ( Volume: 45, Issue: 1, January 1996)
Page(s): 97 - 103
Date of Publication: 31 January 1996

ISSN Information:

First Page of the Article


Contact IEEE to Subscribe

References

References is not available for this document.