Title :
An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks
Author_Institution :
Comput. Sci. Telecommun. Program, Missouri Univ., Kansas City, MO, USA
fDate :
9/1/1995 12:00:00 AM
Abstract :
A k-EMCTN is obtained by adding k more stages in front of a multistage cube-type network (MCTN). It is shown that a permutation is admissible to a k-EMCTN if and only if the conflict graph is 2k -colorable. For the case k=1, an O(NlgN) algorithm is given for constructing the conflict graph, which leads to an O(NlgN) admissibility algorithm. Furthermore, it is shown that Ω(NlgN) bits must be checked in the binary representation of a permutation for determining its admissibility
Keywords :
computational complexity; graph colouring; graph theory; multistage interconnection networks; parallel algorithms; O(NlgN) admissibility algorithm; binary representation; conflict graph; extra-stage cube-type networks; graph colouring; multistage cube-type network; optimal O(NlgN) algorithm; permutation admissibility; Cities and towns; Delay; Fault tolerant systems; Network servers; Processor scheduling; Protocols; Real time systems; Scheduling algorithm; Transform coding; Video compression;
Journal_Title :
Computers, IEEE Transactions on
Conference_Location :
9/1/1995 12:00:00 AM
