{"title":"Design and modeling of clustered RAID","authors":"A. Merchant, Philip S. Yu","doi":"10.1109/FTCS.1992.243606","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243606","url":null,"abstract":"A redundant array of independent disks (RAID) consisting of G disks provides protection against single disk failures by adding one parity block for each G-1 data blocks. In a clustered RAID, the G data/parity blocks are distributed over a cluster of C disks, C>G, thus reducing the additional load on each disk due to a single disk failure. The authors present a fast algorithm for distributing parity groups of size G over C disks. They create mappings for each parity group based on almost-random permutations. An analytical model is constructed to predict recovery time and read/write performance. The analysis shows that the clustered RAID is significantly more tolerant of disk failure than the basic RAID scheme. Both recovery time and performance degradation during recovery are substantially reduced in the clustered RAID.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"83 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":"125422559","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}
M. Chérèque, D. Powell, Philippe Reynier, J. Richier, Jacques Voiron
{"title":"Active replication in Delta-4","authors":"M. Chérèque, D. Powell, Philippe Reynier, J. Richier, Jacques Voiron","doi":"10.1109/FTCS.1992.243618","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243618","url":null,"abstract":"Delta-4 is an open dependable distributed computing systems architecture, in which fault-tolerance is achieved by means of replication of run-time software components on host computers interconnected by a local area network. The authors discuss the coordination of active replicas executing either in a fail-silent host computer environment, or in a full-uncontrolled environment. This coordination is carried out by a specific protocol, the inter replica protocol (IRp). The IRp was implemented in various Delta-4 prototypes. The protocol, the service it delivers, and the environment assumptions were formally specified. The specifications were formally verified for consistency by model checking techniques. The formal specification and verification of IRp are considered. Some implementation details and results of performance tests are given.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"123 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":"122068720","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":"Protecting practical FFT implementations that share common processing elements","authors":"Jamlung Sung, G. Redinbo","doi":"10.1109/FTCS.1992.243593","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243593","url":null,"abstract":"Functional faults are discussed. Before any reconfiguration can be done, the error must first be detected and, then, the malfunctioning unit must be identified. Fault detection is considered. The authors assume there is at most one malfunctioning in the processing array at a time. They describe a general method of detecting any fault occurrence, either permanent or transient, in a practical radix-2 N-point discrete Fourier transform system independent of the technology base and for any reasonable interconnection scheme among these PEs. An algorithm-based fault tolerant (ABFT) concurrent error detection (CED) scheme is derived by scheduling all the PEs with certain characteristics. Two fault detection techniques with these attributes are demonstrated. The general use of gain spaces for ABFT CED scheduling is examined.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"178 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":"122052379","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":"Latent design faults in the development of Multiflow's TRACE/200","authors":"R. Colwell","doi":"10.1109/FTCS.1992.243587","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243587","url":null,"abstract":"The author recounts some of the more notable design faults that appeared during the development of the Multiflow TRACE/200 series of minisupercomputers. During development of the TRACE, the design errors found appeared to be largely random and uncorrelated. However, it appears that a fairly small set of categories can nearly span the set. These faults fall roughly into a few categories: interface misassumptions, stale-instructions-in-cache, parity-related, designer errors, CAD tools, and parts with defective designs. Specific examples are given for each category, and corrections for these design flaws are mentioned.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"17 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":"121454638","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":"Replicated distributed processes in Manetho","authors":"E. Elnozahy, W. Zwaenepoel","doi":"10.1109/FTCS.1992.243619","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243619","url":null,"abstract":"The authors present the process-replication protocol of Manetho, a system whose goal is to provide efficient, application-transparent fault tolerance to long-running distributed computations. Manetho uses a novel negative-acknowledgment multicast protocol to enforce the same receipt order of application messages among all replicas of a process. The protocol depends on a combination of antecedence graph maintenance, a form of sender-based message logging, and the fact that the receivers of each multicast execute the same deterministic program. This combination allows the protocol to void the delay in application message delivery that is common in existing negative-acknowledgment multicast protocols, without giving up the advantage of requiring only a small number of control messages.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"131 4 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":"125788744","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 multiple undirectional byte error-detecting codes for computer memory systems","authors":"T. Rao, G. Feng, Mahadev S. Kolluru","doi":"10.1109/FTCS.1992.243583","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243583","url":null,"abstract":"A novel method of construction of more efficient codes, which can detect t unidirectional byte errors or all unidirectional bit errors (t-UbED/AUED), is presented. In this construction, the authors generalize and improve the t-UbED/AUEd codes proposed by L.A. Dunning et al. (1990) in such a way that two weight syndromes need not be protected from unidirectional errors when t>2. Thus, this construction is more efficient and can be applied to all multiple unidirectional byte error-detecting codes.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"234 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":"127307240","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":"Removal of redundancy in logic circuits under classification of undetectable faults","authors":"S. Kajihara, Haruko Shiba, K. Kinoshita","doi":"10.1109/FTCS.1992.243575","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243575","url":null,"abstract":"The authors describe a method for removing redundant elements using test pattern generation. Redundancy in combinational circuits can be identified from the existence of undetectable stuck-at faults. By classifying undetectable faults into three categories according to their properties obtained in the test pattern generation process, some redundant elements can be concurrently removed. The method produces an irredundant circuit efficiently by using these properties. An improved procedure for redundancy removal is outlined to reduce the number of repetitions of test generation performed in the process. Some environmental results for ISCAS 85 benchmark circuits are also shown.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"2 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018667","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":"An efficient test generation algorithm based on search state dominance","authors":"T. Fujino, H. Fujiwara","doi":"10.1109/FTCS.1992.243577","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243577","url":null,"abstract":"J. Giraldi and M.L. Bushnell (1990) proposed a new test generation method, called the EST (equivalent state hashing) algorithm, which can reduce the search space for test generation by using binary decision diagram fragments to detect previously encountered search states. The authors extend the concept of search state equivalence to that of search state dominance, and propose a new extended method, the DST (dominant state hashing) algorithm, based on the search state dominance. The DST algorithm can prune the search space more effectively than the EST algorithm. The benefits of DST are illustrated through examples of decision trees.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"35 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":"121892620","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":"Outage times in fault-tolerant systems","authors":"A. Reibman","doi":"10.1109/FTCS.1992.243589","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243589","url":null,"abstract":"The author gives sample field outage-time data sets from two fault-tolerant systems and discusses their statistical analysis. He uses probability plots to choose a distributional model for the data and observes that the commonly used exponential model does not fit the data. Instead a distribution is required that has a heavier tail, i.e., more variability and more long outages. A lognormal model is fitted to the data. These fits can then be used in discrete-event simulations or other analytic modeling of system availability.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"5 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":"133874220","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":"Testing with correlated test vectors","authors":"S. Bou-Ghazale, P. Marinos","doi":"10.1109/FTCS.1992.243576","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243576","url":null,"abstract":"The authors present a new built-in self-test (BIST) strategy based on correlated test vectors produced by a weighted random test-pattern generator. It is demonstrated that use of correlated test vectors reduces greatly the hardware complexity of the generator without causing significant degradation in the test outcome. Performance evaluation of this BIST technique is carried out quantitatively via probabilistic methods, and experimentally through deterministic fault simulation. Correlated weighted test patterns using the proposed scheme were applied to the ISCAS 1985 benchmark circuits, and comparisons are made to test results obtained using such techniques as WARP and GSCAN.<<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":"115026468","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}