The diagnosability of k-ary n-cubes with missing edges. Issue 1 (2nd January 2020)

• Record Type: Journal Article
• Authors: Fan, Liqiang; Yuan, Jun
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 35:Issue 1(2020)
• Page Start: 57
• Page End: 68
• Publication Date: 2020-01-02
• Subjects: Interconnection networks -- diagnosability -- fault tolerance -- k-ary n-cubes; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2019.1655741
• Languages: English
• ISSNs: 1744-5760

Abstract

ABSTRACT: The k -ary n -cube is a popular interconnection network for many multiprocessor systems because of its good topological structure. In this paper, we investigated the relationship between the fault diagnosability of k -ary n -cube with missing edges and its minimum degree of vertices. Let G be a k -ary n -cube with missing edges and the minimum degree δ ( G ) = r . Then we show that the diagnosability of G is r for r ≥ 3, n ≥ 2 under the PMC model and BGM model. GRAPHICAL ABSTRACT: