Markov chains and probabilistic computation - A general framework for multiplexed nanoelectronic systems

被引:15
作者
Qi, Y [1 ]
Gao, JB [1 ]
Fortes, JAB [1 ]
机构
[1] Univ Florida, Dept Elect & Comp Engn, Adv Comp & Informat Syst Lab, Gainesville, FL 32611 USA
基金
美国国家科学基金会; 美国国家航空航天局;
关键词
fault tolerance; Markov chain; NAND multiplexing; probabilistic computation;
D O I
10.1109/TNANO.2004.834192
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In emerging nanotechnologies, reliable computation will have to be carried out with unreliable components being integral parts of computing systems. One promising scheme for designing these systems is von Neumann's multiplexing technique. Using bifurcation theory and its associated geometrical representation, we have studied a HAND-multiplexing system recently proposed. The behavior of the system is characterized by the stationary distribution of a Markov chain, which is uni- or bi-modal, when the error probability of NAND gates' is larger or smaller than the threshold value, respectively. The two modes and the median of the stationary distribution are the keys to the characterization of the system reliability. Examples of potential future nanochips are used to illustrate how the HAND-multiplexing technique can lead to high system reliability in spite of large gate error probability while keeping the cost of redundancy moderate. In nanoelectronic systems, while permanent defects can be taken care of by reconfiguration, probabilistic computation schemes can incorporate another level of redundancy so that high tolerance of transient errors may be achieved. The Markov chain model is shown to be a powerful tool for the analysis of multiplexed. nanoelectronic systems.
引用
收藏
页码:194 / 205
页数:12
相关论文
共 50 条
[41]   Sensitivity analysis of Markov chains for M/G/1queueing systems [J].
Ataei, Esfandyar ;
Ataei, Alireza .
LIFE SCIENCE JOURNAL-ACTA ZHENGZHOU UNIVERSITY OVERSEAS EDITION, 2012, 9 (04) :2041-2045
[42]   On V-Geometric Ergodicity Markov Chains of the Two-Inertia Systems [J].
Hu, Feng-Rung ;
Hu, Jia-Sheng .
MATHEMATICS, 2024, 12 (10)
[43]   Identification of Wiener, Hammerstein, and NARX systems as Markov Chains with improved estimates for their nonlinearities [J].
Zhao, Wenxiao ;
Chen, Han-Fu .
SYSTEMS & CONTROL LETTERS, 2012, 61 (12) :1175-1186
[44]   Markov surfaces: A probabilistic framework for user-assisted three-dimensional image segmentation [J].
Pan, Yongsheng ;
Jeong, Won-Ki ;
Whitaker, Ross .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2011, 115 (10) :1375-1383
[45]   A Note on Foster-Lyapunov Drift Condition for Recurrence of Markov Chains on General State Spaces [J].
Xu, Lifeng ;
Zhang, Shaoyi ;
Zhang, Ren .
JOURNAL OF THEORETICAL PROBABILITY, 2018, 31 (04) :1923-1928
[46]   Threshold computation for fault detection in linear discrete-time Markov jump systems [J].
Saijai, Jedsada ;
Ding, Steven X. ;
Abdo, Ali ;
Shen, Bo ;
Damlakhi, Waseem .
INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, 2014, 28 (11) :1106-1127
[47]   Monte Carlo method for solving systems of linear algebraic equations with minimum Markov chains [J].
Taft, K ;
Fathi-Vajargah, B .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, :291-296
[48]   Discrete-time dynamic systems arising from singularly perturbed Markov chains [J].
Yin, G ;
Zhang, Q ;
Yang, H ;
Yin, K .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2001, 47 (07) :4763-4774
[49]   Countable-state-space Markov chains with two time scales and applications to queueing systems [J].
Yin, G ;
Zhang, HQ .
ADVANCES IN APPLIED PROBABILITY, 2002, 34 (03) :662-688
[50]   Combination of Component Fault Trees and Markov Chains to Analyze Complex, Software-controlled Systems [J].
Zeller, Marc ;
Montrone, Francesco .
2018 3RD INTERNATIONAL CONFERENCE ON SYSTEM RELIABILITY AND SAFETY (ICSRS), 2018, :13-20