The ability of one architecture to simulate another is the basis for comparing networks. Embedding is used to analyze these simulations. In architectural simulation, graph embedding is considered one of the most powerful applications for executing parallel algorithms and simulating various interconnection networks. In this work, we embed complete bipartite graphs into some special classes of chordal graphs and obtain its wirelength.