Abstract
Hamiltonian Cycle in Folded Hypercubes With Highly Conditional Edge Faults
Highlights
Since processors in multiprocessor systems are communicated by an interconnection network, the demand performance of designing networks are important and indispensable
We show that FQn − FFe contains a fault-free Hamiltonian cycle of length 2n, where n ≥ 3
As the number of processors increasing in a multiprocessor system, the reliability of the parallel computing system becomes a significant issue
Summary
Since processors in multiprocessor systems are communicated by an interconnection network (network for short), the demand performance of designing networks are important and indispensable. Cycle is suitable for designing simple algorithms with low communication costs, and which is can be used as control/data flow structures for the distributed computing in arbitrary networks [2], [7]. These excellent applications motivate us to embed the cycle properties in networks. We briefly summarize of previously reported properties by researchers and our main property of this paper for fault-tolerant cycle embedding in FQn as Table 1. A briefly summarize of the fault-tolerant cycle embedding properties in FQn. Section 3 provides the main property of the Hamiltonian cycle embedding in folded hyperucbes.
Sign-in/Register to view highlights & summary 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.
