On optimal vertex ordering of Cartesian product of complete graphs and its optimal layout on paths and grids
S. Rajeshwari, M. Rajesh · International Journal of Parallel Emergent and Distributed Systems · 2025
A complex network of processors and communication channels, known as an interconnection network, is used by components in a parallel computing system to share data. In computer networks, where positioning various modules on the integrated circuit is one of the primary cost requirements, performing concurrent algorithms in these intricate, organized circuits requires the use of graph embedding. The placement issue in circuit designs, without any deterministic algorithms, can be resolved by determining the most suitable layout. Such a network allocation process can be carried out using graph embedding. This study establishes the optimal arrangement of processors to obtain minimum wirelength for embedding the Cartesian product of complete graphs into paths and grids.