Abstract

The k-ary n-cube is one of the most attractive interconnection network topologies for parallel computing systems. In this paper, we derive an upper bound on the k-ary (n−1)-cube reliability in a k-ary n-cube with odd k≥3 using the probability fault model. An approximate k-ary (n−1)-cube reliability result is also obtained using the fixed partitioning. The numerical results show that the k-ary (n−1)-cube reliabilities under the probability fault model and the fixed partitioning are in good agreement. The numerical results are also shown to be consistent with and close to the simulation results.

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 call

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.