Title :
On computing the combinatorial power of SW-banyan networks
Author :
Roberts, Robert S. ; Kothari, S.C.
Author_Institution :
New Mexico State Univ., Los Cruces, NM, USA
fDate :
5/1/1989 12:00:00 AM
Abstract :
The problem of calculating the combinatorial power of certain SW-banyan networks is related to a problem of enumerating certain matrices. Examples of two- and three-stage networks are used to demonstrate the technique. In each case, a polynomial-time algorithm is found to solve the problem. The results are presented for each case and certain asymptotic behavior is noted
Keywords :
computational complexity; graph theory; matrix algebra; SW-banyan networks; asymptotic behavior; combinatorial power; matrices; polynomial-time algorithm; three-stage networks; two-stage networks; Computer networks; Contracts; Multiprocessor interconnection networks; Parallel processing; Polynomials; Switches;
Journal_Title :
Computers, IEEE Transactions on
