Efficient Layouts of Complete t-Partite and Complete Networks into 3-Ary n-Cubes for Optimized Parallel Processing in Multiprocessing Systems

Embedding problems has received a lot of attention in the last decades by various research dealt with many inter-connection networks. Through embedding the existing parallel algorithm of an interconnection network can be used for the embedded network, thus it plays a vital role in manipulating the parallel algorithms of interconnection network in multiprocessing systems. A variation of the k -ary n-cube, notable for its adaptive network structure created to provide efficient parallel processing on multicomputers, is the 3-ary n-cube. In this study, complete t-partite graphs and complete graphs are embedded into 3-ary n-cubes with the least wirelengths.