Journal
THEORETICAL COMPUTER SCIENCE
Volume 582, Issue -, Pages 48-59Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2015.03.027
Keywords
Burnt pancake networks; Fault tolerance; Comparison model; Extra connectivity; Conditional diagnosability
Categories
Funding
- National Natural Science Foundation of China [61072080]
- Natural Science Foundation of Fujian Province [JA12073, 2013J01221]
- Fujian Normal University Innovative Research Team [IRTL1207]
- Fujian Province Science and Technology Project [JK2014009]
- Fuzhou Science and Technology Plan Project [2014-G-80]
Ask authors/readers for more resources
Processor fault diagnosis plays an important role in measuring the reliability of a multiprocessor system, and the diagnosabilities of many well-known multiprocessor systems have been investigated. The conditional diagnosability has been widely accepted as a new measure of diagnosability by assuming an additional condition that any faulty set can't contain all the neighbors of any node in a multiprocessor system. In this paper, we explore algebraic and combinatorial properties of burnt pancake networks, and investigate the structural vulnerability as well as super and extra connectivities. Furthermore, we show that the classic diagnosability and the conditional diagnosability of n-dimensional burnt pancake network BPn (n >= 4) are n and 3n - 4, respectively. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available