Abstract
Multiprocessor systems commonly take interconnection network (simply graph) as the underlying topological structure. The performance of multiprocessor systems is greatly influenced by their network topologies. The connectivity is a classical metric to evaluate the fault tolerance of multiprocessor systems. In this work, we propose a composite graph based on disc-ring and folded hypercube, DFQ(m,d,n) (simply, DFQn). Compared with the compound graph DQcube (DQn), DFQn shows better performance in terms of many metrics such as diameter, connectivity and layout cost. In detail, we first show that the connectivity, edge-connectivity and tightly super connectivity are n+2 uniformly. Furthermore, we show that h-extra connectivity of DFQn is κh(DFQn)=(h+1)(n+2)−2h−(h2).
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
