{"title":"Protecting processing elements in communications satellites","authors":"G. Redinbo","doi":"10.1109/FTCS.1992.243620","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243620","url":null,"abstract":"Fault tolerance features in the first three major subsystems of the satellite up-link resources are described. The critical processing subassemblies are the demultiplexer, demodulators, and forward error-correcting decoders. The extra checking resources needed for fault tolerance also serve as replacements for failed units during reconfiguration. The demultiplexer, an efficient multirate filter bank, containing a fast Fourier transform (FFT) section, is protected by a high rate real number convolutional code, and parity values are computed in parallel at a much reduced rate. The redundancies inherent in the binary convolutional code used to combat transmission noise afford protection for the Viterbi decoders. Selected invariant features of the Viterbi algorithm coupled with the code structure constantly monitor values within the decoder. The demodulators are protected by virtue of their location between two protected units, the demultiplexer and the decoders.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"2020 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":"133840633","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":"Performance bounds in list scheduling of redundant tasks on multiprocessors","authors":"Dar-Tzen Peng","doi":"10.1109/FTCS.1992.243600","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243600","url":null,"abstract":"The author studies the worst-case performance of the LPT (longest processing time first) scheduling algorithm for independent tasks with redundancies on multiprocessor systems. The performance bounds for the case of no redundancy are derived first and are then used to compute those for the case with redundancies. For cases without redundancy, Graham's bound w/w/sub 0/<or=4/3-1/3m is refined by showing that (1) the LPT algorithm is actually optimal when the number of tasks is smaller than a derived constant, and (2) a strictly better bound is available when this number is relatively large. For cases with redundancies, good performance bounds are derived. It is shown that the bound is valid for systems where tasks may even have different numbers of redundant copies.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"18 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":"125217008","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":"Efficient utilization of spare capacity for fault detection and location in multiprocessor systems","authors":"S. Tridandapani, Arun Kumar Somani","doi":"10.1109/FTCS.1992.243591","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243591","url":null,"abstract":"One scheme for detecting faults at the processor level in a multiprocessor system (see A. Dahbura et al., 1989) works by running secondary versions of jobs on the unused, or spare, processors of the system. The authors build upon this scheme and propose three new multiprocessor allocation strategies that run a viable number of versions per job. These schemes permit online detection and, in some cases, location of faulty processors in a system, without degrading its delay/throughput performance. Two new metrics, the fault detection capability and the fault location capability, are introduced to evaluate these schemes. Extensive simulation results are provided to show that these schemes utilize spare capacity more efficiently, thereby improving upon the fault detection and location capabilities of the system.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"51 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":"127253461","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":"Unordered error-correcting codes and their applications","authors":"M. Blaum, Jehoshua Bruck","doi":"10.1109/FTCS.1992.243585","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243585","url":null,"abstract":"The authors give efficient constructions for error correcting unordered codes, i.e., codes such that any two codewords are at a certain minimal distance apart and at the same time they are unordered. They present three constructions together with tables that compare their efficiencies. These codes are used for detecting a predetermined number of symmetric errors and for detecting all unidirectional errors. An application to parallel asynchronous communications is included.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"25 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":"127823945","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":"Efficient fault-tolerant mesh and hypercube architectures","authors":"Jehoshua Bruck, R. Cypher, C. T. Ho","doi":"10.1109/FTCS.1992.243604","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243604","url":null,"abstract":"The authors present an efficient method for tolerating faults in d-dimensional mesh and hypercube architectures. The approach consists of adding spare processors and communication links so that the resulting architecture can be reconfigured to form the desired mesh or hypercube in the presence of faults. The cost of the fault-tolerant architecture is optimized by adding exactly k spare processors and minimizing the number of links per processor. The results are surprisingly efficient. For example, when the desired architecture is a d-dimensional mesh and k=1, the fault-tolerant architecture has the same maximum degree as the desired architecture and has only one spare processor. Efficient layouts are presented for fault-tolerant two- and three-dimensional meshes, and it is shown that multiplexers and buses can be used to reduce the degree of the fault-tolerant architectures.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"1977 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":"130130112","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":"Direct methods for synthesis of self-monitoring state machines","authors":"S. H. Robinson, John Paul Shen","doi":"10.1109/FTCS.1992.243570","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243570","url":null,"abstract":"The authors consider synthesis methods that yield state assignments with checking invariants amenable to signature monitoring. They describe an automated synthesis approach based on a novel, generalized monitor architecture and prove that, for any given finite-state machine (FSM), a special, methodology-consistent state assignment exists. The state assignment permits each state's reference signature to be extracted directly from the state code. This eliminates the need for explicit reference-signature storage and yields continuous monitoring with near zero error-detection latency at each state. A practical tool that implements these synthesis algorithms can, in 37 seconds, generate state assignments for all 41 MCNC synthesis benchmark FSMs. Layout overhead comparisons obtained with an FSM macro-cell CAD system show that this technique can require as little as 52.3% of traditional duplication's layout area.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"11 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":"121275257","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":"Models for time coalescence in event logs","authors":"Jeffery P. Hansen, D. Siewiorek","doi":"10.1109/FTCS.1992.243597","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243597","url":null,"abstract":"One heuristic for data reduction that is widely used in the literature is coalescence of events occurring close in time. The authors explore the validity of this heuristic by developing a model for the formation of the contents of an event log by multiple independent error processes. The probability of coalescing events from two or more error sources is formulated and compared with results from hand analysis of actual event logs taken from a Tandem TNS II system. Results indicate that the probability of coalescing events from more than one error source is a strong function of the time constant selected. The model can be used to select an appropriate time constant and also has implications in designing event logging systems.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"50 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":"121581664","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 new statistical approach for fault-tolerant VLSI systems","authors":"C. Stapper","doi":"10.1109/FTCS.1992.243565","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243565","url":null,"abstract":"A novel approach to the statistics of fault-tolerant VLSI systems is presented by compounding binomial distributions with a beta distribution. This technique was discovered in the analysis of fault-tolerant dynamic random-access memory (DRAM) chips. Manufacturing data supporting this method are shown and the application of the approach to standard fault-tolerance schemes is described. Special forms of these statistics for computer calculations are also discussed and examples are given.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"137 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":"115060368","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":"Uniformization and exponential transformation: Techniques for fast simulation of highly dependable non-Markovian systems","authors":"V. Nicola, P. Heidelberger, P. Shahabuddin","doi":"10.1109/FTCS.1992.243607","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243607","url":null,"abstract":"The authors consider the estimation of system unreliability in highly dependable non-Markovian systems. They describe two alternative approaches to importance sampling for estimating transient reliability measures in such systems. One is based on the uniformization method of Monte Carlo simulation and the other uses an importance sampling distribution in which the failure times of components are sampled from the exponential distribution with rates higher than the original hazard rates. Implementation issues relevant to estimating system unreliability are discussed. Experimental results are given to illustrate the effectiveness of the proposed importance sampling techniques. Besides several small examples used for experimentation, a large example is used to illustrate the effectiveness of this technique for problems that are analytically intractable.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"331 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":"123101125","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":"Fault injection for the formal testing of fault tolerance","authors":"D. Avresky, J. Arlat, J. Laprie, Y. Crouzet","doi":"10.1109/FTCS.1992.243566","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243566","url":null,"abstract":"The authors address the issue of the use of fault injection for explicitly removing design/implementation faults in fault tolerance algorithms and mechanisms. A formalism is introduced that represents the fault tolerance algorithms and mechanisms by means of a set of assertions. This formalism enables the execution tree to be presented, where each path from the root to a leaf of the tree is a well-defined formula. It provides a framework for the generation of a functional deterministic test for programs implementing complex fault tolerance algorithms and mechanisms. This methodology has been used to extend a debugging tool aimed at testing fault tolerance protocols developed by BULL France. It has been successfully applied to the injection of faults in the inter-replica protocol supporting the application-level fault tolerance features of the architecture of the ESPRIT-funded Delta-4 project. The results of these experiments are discussed and analyzed.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"13 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":"115698946","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}