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 条
[31]   Hoeffding's Inequality for General Markov Chains and Its Applications to Statistical Learning [J].
Fan, Jianqing ;
Jiang, Bai ;
Sun, Qiang .
JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
[32]   Variational formulas for asymptotic variance of general discrete-time Markov chains [J].
Huang, Lu-Jing ;
Mao, Yong-Hua .
BERNOULLI, 2023, 29 (01) :300-322
[33]   A flexible framework for coding and predicting acute hypotensive episodes using Markov chains [J].
Galeana-Zapien, Hiram ;
Aldana-Bobadilla, Edwin ;
Arciniegas-Garcia, Jaime ;
Vargas-Gomez, Jordy ;
Villalobos-Silva, Jose .
KNOWLEDGE-BASED SYSTEMS, 2024, 284
[34]   Performance Assessment of High-availability Systems using Markov Chains [J].
Avritzer, Alberto .
ICPE'17: COMPANION OF THE 2017 ACM/SPEC INTERNATIONAL CONFERENCE ON PERFORMANCE ENGINEERING, 2017, :209-209
[35]   Aggregation/Disaggregation Iterative Methods Applied to Leontev Systems and Markov Chains [J].
Ivo Marek ;
Petr Mayer .
Applications of Mathematics, 2002, 47 (2) :139-156
[36]   Optimal Linear Responses for Markov Chains and Stochastically Perturbed Dynamical Systems [J].
Fadi Antown ;
Davor Dragičević ;
Gary Froyland .
Journal of Statistical Physics, 2018, 170 :1051-1087
[37]   Optimal Linear Responses for Markov Chains and Stochastically Perturbed Dynamical Systems [J].
Antown, Fadi ;
Dragicevic, Davor ;
Froyland, Gary .
JOURNAL OF STATISTICAL PHYSICS, 2018, 170 (06) :1051-1087
[38]   A Note on Foster–Lyapunov Drift Condition for Recurrence of Markov Chains on General State Spaces [J].
Lifeng Xu ;
Shaoyi Zhang ;
Ren Zhang .
Journal of Theoretical Probability, 2018, 31 :1923-1928
[39]   Integral conditions for the invertibility of Markov chains on a half-line with general measure of irreducibility [J].
Isakova T.I. ;
Filonov Yu.P. .
Ukrainian Mathematical Journal, 2004, 56 (5) :852-861
[40]   Implementation of Markov Chains for Probabilistic Forecast of Different Conditions of Moistening in Vegetation Period Based on Example of Voronezh [J].
Akimov, L. M. .
ARID ECOSYSTEMS, 2012, 2 (04) :220-224