Abstract
Embedding a (guest) graph into (host) another graph can be utilized for structural simulation, processor allocation, and algorithm porting in the field of parallel architecture. Dilation and edge congestion are two prominent indicators which evaluate the quality of the embedding. In this paper, we consider the guest graph as hypercube network and the host graphs to be exchanged hypercube and optical multi-mesh hypercube. We propose new ordering which minimizes dilation and edge congestion. We also compute the layout of embedding hypercube into the aforementioned interconnection networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Parallel, Emergent and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
