A Fault-Tolerant Reconfiguration Scheme in the Faulty Star Graph
نویسندگان
چکیده
Received October 23, 1997; revised March 27, 1998; accepted May 13, 1998. Communicated by Shing-Tsaan Huang. *A preliminary version of this paper appeared in the Proceedings of the IEEE Second International Conference on Algorithms & Architectures for Parallel Processing (ICA3PP’96). *This research was supported in part by the National Science Council, R.O.C., under Grant number NSC86-2213E-216-022. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 16, 25-40 (2000)
منابع مشابه
Algorithm - Based Fault - Tolerant Strategies in FaultyHypercube and Star
This dissertation addresses the design of algorithm-based fault-tolerant strategies in faulty hypercube and star graph multicomputers without hardware modi cation. Several new concepts and designs are presented here under the permanent and transient fault models. Under the permanent fault model, we propose a new fault-tolerant recon guration scheme in the faulty hypercube and star graph multico...
متن کاملA Fault-tolerant Reconnguration Scheme in the Faulty Star Graph
In this paper, we propose a scheme to identify the maximal fault-free substar-ring. This is the rst result to derive a reconnguration scheme with high processor utilization in the faulty n-star graph. The maximal fault-free substar-ring is connected by a ring of fault-free virtual substars with dilation 3 and maximal length of the ring is n(n ? 1)(n ? 2). Our proposed scheme can tolerate n ? 3 ...
متن کاملA Fault-tolerant Routing Algorithm based on Safety Levels in a Hyper-Star Graph
A hyper-star graph HS(n, k) provides a promising topology for interconnection networks of parallel processing systems because it combines the merits of a hypercube and a star graph. In this study, we propose a fault-tolerant routing algorithm that establishes a fault-free path between any pair of non-faulty nodes in an HS(n, k) with faulty nodes by using limited global information called safety...
متن کاملOptimal Time Broadcasting Schemes in Faulty Star Graphs
We propose two fault-tolerant broadcasting schemes in star graphs. One of the schemes can tolerate up to n − 2 faults of the crash type in the n-star graph. The other scheme can tolerate up to ⌊ n−3d−1 2 ⌋ faults of the Byzantine type in the n-star graph, where d is the smallest positive integer satisfying n ≤ d!. Each of the schemes is designed for the single-port mode, and it completes the br...
متن کاملFault tolerant communication algorithms on the star network using disjoint paths
One way to achieve fault tolerant communication on in2erconneclion networks is by exploiting and effectively utilizing Ihe disjoint paths 2hai exist between pairs of source and destination nodes. In this paper, we construc2 a graph lhal consisls of n 1 directed edgedisjoint spanning trees on the star network. This graph is used lo derive fault tolerant algorithms for the singlenode and mullinod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 16 شماره
صفحات -
تاریخ انتشار 2000