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 条
[21]   A NEW CONDITION FOR ERGODICITY OF MARKOV CHAINS WITH A GENERAL STATE SPACE [J].
Golubin, A. Y. .
THEORY OF PROBABILITY AND ITS APPLICATIONS, 2025, 70 (01) :151-158
[22]   The Central Limit Theorem for Markov Chains with General State Space [J].
Nagaev S.V. .
Siberian Advances in Mathematics, 2018, 28 (4) :265-302
[23]   USING MARKOV CHAINS TO DETERMINE EXPECTED PROPAGATION TIME FOR PROBABILISTIC ZERO FORCING [J].
Chan, Yu ;
Curl, Emelie ;
Geneson, Jesse ;
Hogben, Leslie ;
Liu, Kevin ;
Odegard, Issac ;
Ross, Michael .
ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2020, 36 :318-333
[24]   Molecular Computation of Complex Markov Chains with Self-Loop State Transitions [J].
Salehi, Sayed Ahmad ;
Riedel, Marc D. ;
Parhi, Keshab K. .
2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2017, :478-483
[25]   P Systems Computing the Period of Irreducible Markov Chains [J].
Cardona-Roca, Monica ;
Angels Colomer-Cugat, M. ;
Riscos-Nunez, Agustin ;
Rius-Font, Miquel .
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2009, 4 (03) :291-300
[26]   Strict Kantorovich contractions for Markov chains and Euler schemes with general noise [J].
Huang, Lu-Jing ;
Majka, Mateusz B. ;
Wang, Jian .
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2022, 151 :307-341
[27]   A useful version of the central limit theorem for a general class of Markov chains [J].
Czapla, Dawid ;
Horbacz, Katarzyna ;
Wojewodka-Sciazko, Hanna .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2020, 484 (01)
[28]   Some results about the Markov chains associated to GPs and general EAs [J].
Mitavskiy, Boris ;
Rowe, Jonathan .
THEORETICAL COMPUTER SCIENCE, 2006, 361 (01) :72-110
[29]   PROBABILISTIC FAILURE ANALYSIS OF STRUCTURES USING IMPORTANCE SAMPLING-BASED MARKOV CHAINS [J].
Fan Xue-ping ;
Lu Da-gang .
INNOVATION & SUSTAINABILITY OF STRUCTURES, VOLS 1 AND 2, 2011, :1466-1466
[30]   PROBABILISTIC CELLULAR AUTOMATA WITH GENERAL ALPHABETS POSSESSING A MARKOV CHAIN AS AN INVARIANT DISTRIBUTION [J].
Casse, Jerome .
ADVANCES IN APPLIED PROBABILITY, 2016, 48 (02) :369-391