{"title":"Reliability modeling of large fault-tolerant systems","authors":"N. Suri, Michelle M. Hugue, C. Walter","doi":"10.1109/FTCS.1992.243598","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243598","url":null,"abstract":"A cluster-based ultrareliable architecture is presented, offering synchronization and system functionality comparable to that of fully connected systems, with reduced system overhead. A reliability model considering the distribution of concurrent faults across the system clusters is shown to increase the accuracy of reliability and system fault-tolerance estimates. The hybrid fault model, which classifies faults based on their behavior, further improves reliability estimates and enhances the fault handling capability of each cluster. Linear growth in cluster reliability with respect to cluster size is possible, as are refinements in the convergence and consistency algorithms for synchronization.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131343687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A divide-and-conquer approach to test generation for large synchronous sequential circuits","authors":"I. Pomeranz, S. Reddy","doi":"10.1109/FTCS.1992.243579","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243579","url":null,"abstract":"A method for generating tests for synchronous sequential circuits that does not use the complete circuit description is proposed, to allow true divide-and-conquer to be applied to test generation. The method is based on the generation of primary input sequences such that for as many sequences generated by the adjacent subcircuits as possible, a test sequence for the subcircuit under consideration would result. Repeated application of test sequences is proposed as a means of increasing the probability of fault detection. Experimental results are presented to show that the method is applicable to subcircuits of large sequential circuits.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114870689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Finite state machine testing based on growth and disappearance faults","authors":"M. Srinivas, J. Jacob, V. Agrawal","doi":"10.1109/FTCS.1992.243578","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243578","url":null,"abstract":"An approach to generating functional test sequences. for synchronous sequential nonscan circuits is presented. The method is applicable when the functional description of the circuit can be obtained in the cubical form or a personality matrix. The faults are modeled as growth and disappearance faults in the cubical description of the irredundant combinational function of the finite state machine (FSM). Considering the combinational logic alone, test vectors for these faults are efficiently derived using a cube-based method developed for programmable logic arrays. Experimental results on MCNC synthesis benchmark FSMs and some ISCAS89 sequential circuits show that the approach can efficiently obtain functional test sequences which give very high coverage of stuck faults in specific implementations. The functional test sequences are implementation independent and can be obtained even when details of specific implementation are unavailable or unknown.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"577 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal ring embedding in hypercubes with faulty links","authors":"S. Latifi, Si-Qing Zheng, N. Bagherzadeh","doi":"10.1109/FTCS.1992.243602","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243602","url":null,"abstract":"The authors show that in an n-dimensional hypercube (Q/sub n/), up to n-2 links can fail before destroying all available Hamiltonian cycles. They present an efficient algorithm which identifies a characterization of a Hamiltonian cycle in Q/sub n/, with as many as n-2 faulty links, in O(n/sup 2/) time. Generating a fault-free Hamiltonian cycle from this characterization can be easily done in linear time. An important application of this work is in optimal simulation of ring-based multiprocessors or multicomputer systems by hypercubes. Compared with the existing fault-tolerant embeddings based on link-disjoint Hamiltonian cycles, the algorithm specifies such a cycle that tolerates twice as many faulty links.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127808935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Synthesis of multi-level combinational circuits for complete robust path delay fault testability","authors":"N. Jha, I. Pomeranz, S. Reddy, Robert J. Miller","doi":"10.1109/FTCS.1992.243573","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243573","url":null,"abstract":"Several synthesis rules for obtaining a multilevel multioutput logic circuit with 100% hazard-free robust testability of path delay faults are explored. In the simplest of these rules, an irredundant two-level implementation of the logic function, which is not robustly testable, is modified to a three-level or a four-level completely robust testable implementation. Algebraic factorization is applied to the modified implementation to obtain a completely robust testable multi level circuit at a relatively low area overhead. This rule was found to make most of the considered Berkeley programmable logic array (PLA) benchmark realizations completely testable. For a small number of cases where this synthesis rule is only partially applicable, another rule is presented, which can guarantee complete testability, but at a slightly higher area overhead. Both these synthesis rules also ensure testability of all multiple stuck-at faults with an easily derivable test set. Four other heuristic synthesis rules that can aid in obtaining a completely robust testable circuit at a lower area overhead in some cases are also presented.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"478 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127570523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast simulation of Markovian reliability/availability models with general repair policies","authors":"S. Juneja, P. Shahabuddin","doi":"10.1109/FTCS.1992.243605","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243605","url":null,"abstract":"Markovian models of highly reliable systems are considered. An importance sampling based variance reduction technique known as failure biasing has been found to be very useful in the fast Monte Carlo simulation of such systems. The authors show by examples that existing failure biasing heuristics break down for systems which involve more general repair/recovery policies that are common in practice. This motivated a detailed look at the theory of failure biasing from a different perspective than what has been done before, i.e., the effect of failure biasing on sample paths of the Markov chain that involve cycles. This cycling perspective is used to give a much simpler proof of the established fact that existing failure biasing heuristics produce an order of magnitude increase in simulation efficiency over standard simulation, for a class of Markovian systems with simple repair policies. This approach allows the development of theory and efficient heuristics for systems with the more general repair policies.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121604270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Recovery/serviceability system test improvements for the IBM ES/9000 520 based models","authors":"Ann C. Merenda, Edward P. Merenda","doi":"10.1109/FTCS.1992.243588","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243588","url":null,"abstract":"To assist recovery and serviceability testing, the authors dramatically increased the amount of error injection hardware built into the logic of the ES/9000 520 based models. Compare circuits were incorporated into each functional element such that, under program control from either the processor controller or instructions executing on the processor, hardware malfunction conditions could be injected in any element. These hardware malfunctions could be synchronized to occur under a vast majority of the command and data transfer operations that occur during normal machine operation. Also, they combined recovery and serviceability system testing. In system testing, they verified recovery and serviceability with a single fault injection, halving the number of hardware fault injections required.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115051540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Closure and convergence: a formulation of fault-tolerant computing","authors":"A. Arora, M. Gouda","doi":"10.1109/FTCS.1992.243596","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243596","url":null,"abstract":"The authors give a formal definition of what it means for a system to tolerate a class of faults. The definition consists of two conditions. First, if a fault occurs when the system state is within some larger set and, if faults continue occurring, the system state remains within that larger set. Second, if faults stop occurring, the system eventually reaches a state within the legal set. The authors demonstrate the applicability of the definition for stating and verifying the fault-tolerance properties of a variety of digital and computer systems. Using the definition, a simple classification is obtained of fault-tolerant systems, and methods for the systematic design of fault-tolerant systems are outlined.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124987902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}