报告题目：Survey of Reliability Assessment on (n, k)-StarGraph-based Multiprocessor System

报 告 人： 周书明 教授 福建师范大学

照    片：

邀 请 人：朱强

报告时间：2020年11月19日（周四）14：30-15：30

腾讯会议ID：721 798 314 会议密码：111111

报告人简介：Shuming Zhou received the Ph.D. degree in Mathematics from Xiamen University, China, in June 2005. He then joined the School of Mathematics and Computer Science, Fujian Normal University, and now he is a professor and Ph.D. supervisor. He was a visiting scholar at University of Science and Technology of China (2010.9-2011.7). Before that, he received the B.S. degree from Hubei Institute for Nationalities in 1996, and received the M.S. degrees in Jiangxi Normal University in 2002.His research interests include group and graph theory, interconnection networks, fault tolerant computing, complex network and social network. He has published over 70 technical papers in international journals such as IEEE TC, IEEE TPDS, IEEE TR, INS, TCS, JPDC, DAM, Physica A and PLA on these topics since 2005.

报告摘要： Large-scale self-diagnosable distributed multiprocessor systems are useful in providing dependable computing platforms for critical applications, and the performability of such multiprocessor systems rely heavily on the underlying architecture connecting the processors. This topic conducts a survey of progress on the investigation of topological robustness on the multiprocessor system based on (n,k)-star graph. In detail, we will address its algebraic property, and conditional diagnosability, g-extra diagnosability under different models. We will also explore the reliability of subsystem under macro-scale through combinatorial probabilistic model and present a practical analytical method to compute the mean time to failure (MTTF) for subsystem through stochastic process along with some empirical analysis.