Graph Embedding for Minimum Wirelength in Circulant Networks: Applications in Architecture Simulation and Comparative Analysis

Graph embedding serves as a fundamental technique for mapping a guest graph onto a host graph. Within the realm of architecture simulation, it is acknowledged as a potent application for implementing parallel algorithms and simulating various interconnection networks. In this paper, we present the results of our study on the minimum wirelength achieved through embedding onto circulant networks and its application in architecture simulation. Specifically, we examine the wirelength of circulant networks when embedded into certain tree networks and the star of cycle, and compare the obtained wirelengths. Additionally, we discuss the implementation of a rooted complete binary tree. The results obtained from our research provide valuable insights into wirelength optimization in architecture simulation, showcasing the effectiveness of graph embedding techniques.