{"title":"Disk array storage system reliability","authors":"W. Burkhard, J. Menon","doi":"10.1109/FTCS.1993.627346","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627346","url":null,"abstract":"Fault tolerance requirements for near term disk array storage systems are analyzed. The excellent reliability provided by RAID Level five data organization is seen to be insufficient for these systems. The authors consider various alternatives - improved MTBF and MTTR times as well as smaller reliability groups and increased numbers of check disks per group - to obtain the necessary improved reliability. Two data organization schemes based on maximum distance separable error correcting codes are introduced. Several figures of merit are calculated using a standard Markov failure and repair model for these organizations. Based on these results, the multiple check disk approach to improved reliability is an excellent option.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127519852","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 class of error locating codes for byte-organized memory systems","authors":"E. Fujiwara, M. Kitakami","doi":"10.1109/FTCS.1993.627313","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627313","url":null,"abstract":"Error locating codes (EL codes), first proposed by J.K. Wolf and B. Elspas (1963), have the potential to be used to identify the faulty module for fault isolation and reconfiguration in fault-tolerant computer systems. A new class of EL codes suitable for memory systems organized with b-bit (b/spl ges/2) byte-organized semiconductor memory chips which are mounted on memory cards each having B-bit width is proposed. The proposed linear code, called S/sub b/B/EL code, identifies erroneous memory card locations containing a faulty byte-organized chip. Another important linear code proposed in this work, SEC-S/sub b/B/EL code, corrects single bit errors induced by alpha particles and, for byte errors, it locates erroneous card positions containing a faulty chip. The design methods of the proposed codes are described, and the decoding hardware and the error detection capabilities are evaluated.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123435079","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 replication protocol exploiting logical tree structures","authors":"H. Koch","doi":"10.1109/FTCS.1993.627341","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627341","url":null,"abstract":"An efficient approach for managing replicated data and services is presented. The approach is based on the fact that the replicas are organized in a logical tree structure. An algorithm exploiting this structure is developed, leading to a strategy in which at best only a single replica for performing read operations and only O[log n] replicas for executing write operations have to be accessed. The author analyzes cost and availability of the operations and compares the new strategy with other replication strategies in order to show the cases in which the new strategy is superior. Finally, the author presents a hybrid approach which is obtained by combining the new strategy and other replication protocols. The obtained hybrid strategies provide low cost operations and at the same time high operation availabilities.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239037","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":"Early delivery totally ordered multicast in asynchronous environments","authors":"D. Dolev, S. Kramer, D. Malkhi","doi":"10.1109/FTCS.1993.627357","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627357","url":null,"abstract":"The authors present the construction of a multicast service, called agreed multicast, that guarantees that messages arrive reliably and in the same total-order to all their destinations. ToTo, a novel protocol, implements the agreed multicast service of Transis, a communication subsystem for the High Availability project, currently developed at the Hebrew University of Jerusalem. This service is desired in distributed systems, and supports high level coordination among groups of processes in distributed applications. The ToTo protocol is genuinely symmetric and fairly simple for implementing. It provides early delivery latency, and requires as little as n/2 messages for forming agreement on the order of delivery. Experimental results show up to O(log (n)) speedup over previous protocols, which matches the authors' prediction of the expected speedup. Using the Transis membership service, ToTo can operate in a dynamic environment, and continue to form an agreed total order among the connected machines despite failures and recoveries.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127671635","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":"Concurrent error detection/correction in the HAL MMU chip","authors":"D. Chang, N. Saxena","doi":"10.1109/FTCS.1993.627366","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627366","url":null,"abstract":"The authors describe three concurrent error detection and correction methods used in various address translation tables in the HAL Memory Management Unit (MMU). Virtually indexed and virtually tagged cache architecture is exploited to provide an almost fault-secure hardware coherence mechanism in MMU. Low overhead linear polynomial codes have been chosen in these designs to minimize both the hardware and software instrumentation impact.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"14 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125760730","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-tolerant wormhole routing in meshes","authors":"C. Glass, L. Ni","doi":"10.1109/FTCS.1993.627327","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627327","url":null,"abstract":"It is shown how to modify the routing algorithms produced by the turn model to encompass dynamic faults. The authors describe how to modify the negative-first routing algorithm, which the turn model produces for n-dimensional meshes without virtual channels, to make it one-fault tolerant. Simulations of the one-fault-tolerant routing algorithms in a two-dimensional mesh indicate that misrouting increases communication latencies significantly at high throughputs. The conclusion is that misrouting should be used only for increasing the degree of fault tolerance, never for just increasing adaptiveness. Finally, the authors describe how to modify the negative-first routing algorithm to make it (n-1)-fault tolerant for n-dimensional meshes.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121620510","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":"SoRel: A tool for reliability growth analysis and prediction from statistical failure data","authors":"K. Kanoun, M. Kaâniche, J. Laprie, Sylvain Metge","doi":"10.1109/FTCS.1993.627370","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627370","url":null,"abstract":"The authors present a tool for software (and hardware) reliability analysis and evaluation: SoRel. The tool implements a global method for reliability follow up and evaluation in the presence of reliability growth due to design fault removal. SoRel is composed of two parts allowing respectively application of trend tests and reliability growth models. The authors present the method, the trend tests, and the reliability growth models implemented by SoRel, show how these features can help during the validation process, and describe some functionalities of the tool.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"167 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486364","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":"Adaptive voting for fault (VFF) node scheme for distributed self-diagnosis","authors":"Jae Young Lee, H. Youn, A. Singh","doi":"10.1109/FTCS.1993.627351","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627351","url":null,"abstract":"Distributed self-diagnosis has long been proposed to efficiently test multiprocessor and array based systems. Such an approach is also now being considered for testing integrated circuit wafers containing identical circuits. Here the testing is based on a majority voting on the test results from neighboring nodes. The authors identify that the voting for faulty node (VFF) always performs better than the voting for good node (VFG), irrespective of the number of voting cells and fault rate. Based on the VFF approach, an approach to find the optimal number of tests allowing the most accurate test results is proposed. The authors also introduce an adaptive voting scheme by which the time overhead of the traditional voting schemes can be significantly reduced.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131033548","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":"Relaxing consistency in recoverable distributed shared memory","authors":"B. Janssens, W. Fuchs","doi":"10.1109/FTCS.1993.627319","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627319","url":null,"abstract":"Relaxed memory consistency models tolerate increased memory access latency in both hardware and software distributed shared memory systems. In recoverable systems, relaxing consistency has the added benefit of reducing the number of checkpoints needed to avoid rollback propagation. The authors introduce new checkpointing algorithms that take advantage of relaxed consistency to reduce the performance overhead of checkpointing. They also introduce a scheme based on lazy relaxed consistency that reduces both checkpointing overhead and the overhead of avoiding error propagation in systems with error latency. They use multiprocessor address traces to evaluate the relaxed consistency approach to checkpointing with distributed shared memory.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130750238","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":"Dependability evaluation using UltraSAN","authors":"W. Sanders, W. D. Obal","doi":"10.1109/FTCS.1993.627373","DOIUrl":"https://doi.org/10.1109/FTCS.1993.627373","url":null,"abstract":"Dependability evaluation is an important, but difficult, aspect of the design of fault-tolerant computer systems. UltraSAN, a stochastic activity network-based package for model-based performance, dependability, and performability evaluation of such systems, is presented. The package supports solution by both simulation-based and analytic methods. Of particular importance in the evaluation of dependable systems by analytic means is the control of an often explosive state space growth. UltraSAN has the potential to do this, using recently developed reduced base model construction techniques which exploit symmetries inherent in the SAN structure during construction of the underlying stochastic process representation. Four analytic solvers are available: SOR and LU decomposition for steady-state variables, and uniformization for transient instant-of-time and interval-of-time variables. For models with characteristics that preclude analytic solution, transient and steady-state simulation can be used. The use of UltraSAN and reduced base model construction is illustrated by considering the evaluation of a fault-tolerant distributed system. Model generation via an X Windows based graphical interface, stochastic process construction, and model solution, using numerical methods, are illustrated.","PeriodicalId":163645,"journal":{"name":"FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133158437","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}