F. Meyer, Xiao-Tao Chen, Wei-Kang Huang, F. Lombardi
{"title":"Using virtual links for reliable information retrieval across point-to-point networks","authors":"F. Meyer, Xiao-Tao Chen, Wei-Kang Huang, F. Lombardi","doi":"10.1109/FTCS.1997.614094","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614094","url":null,"abstract":"The problem of establishing reliable communication across point-to-point networks is addressed. Several protocols are given, using node-disjoint paths to implement a set of independent virtual links (u-links) between each node pair. The u-links can be used to establish communication between the node pair provided the number and type of failures in the network are limited. Failed devices are classified by whether they are benign (delay and omission faults) or are malicious (not benign). The use of u-links is demonstrated with a protocol for remote information retrieval. With b benign and m malicious faults, retrieval can always be achieved if the graph connectivity exceeds b+2 m. This bound is tight. The authors give a flexible retrieval protocol; it analyzes the responses received thus far, and computes a minimum and maximum number of u-links to send (additional) retrieval requests. Maximal requests guarantee completion of the protocol upon their timeout. With minimal requests, protocol completion is barely possible with no further requests. u-links are extended so that they bounce requests when there is no response, which strengthens the retrieval protocol.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"390 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116329655","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":"How hard is hard real-time communication on field-buses?","authors":"P. Veríssimo, J. Rufino, Liao Ming","doi":"10.1109/FTCS.1997.614084","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614084","url":null,"abstract":"Continuity of service and bounded and known message delivery latency, are reliability requirements of a number of real-time applications, such as those served by field-buses. The analysis and design of such networks, w.r.t. timing properties, has been based on no-fault scenarios, rather than under a performability perspective. In this paper, we do an analytical study of the inaccessibility of CAN and PROFIBUS. The study reveals that previous studies on the access delays of these field-buses were too optimistic, from a performability viewpoint.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133801574","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":"Implementing the Swiss Exchange trading system","authors":"R. Piantoni, C. Stanescu","doi":"10.1109/FTCS.1997.614104","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614104","url":null,"abstract":"The Swiss Exchange (SWX) system is the most sophisticated, to our current knowledge, first fully computerised, stock exchange system integrating trading, clearing, settlement and member back offices. The system consists of two main components, the ES (Exchange System) and the TS (Trading System). The ES has only one instance run by SWX (Swiss Exchange) providing the core functionality allowing to trade against a central order book. The TS has at least one instance per SWX member. The paper focuses on aspects concerning the TS and its specific requirements. After a brief description of the design the paper concentrates on the difficulties encountered while solving the challenging and sometimes conflicting requirements of the project, the current solutions and their shortcomings. Other topics concern the development of tools for performance prediction, evaluation and tuning and the final testing and deployment of the system.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"18 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116098943","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":"Microarchitectural synthesis of ICs with embedded concurrent fault isolation","authors":"S. Hamilton, A. Orailoglu","doi":"10.1109/FTCS.1997.614107","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614107","url":null,"abstract":"In an increasing number of applications, reliability is essential. On-line resiliency when confronted with permanent faults is a difficult and important aspect of providing reliability. Particularly vexing is the problem of fault identification. Current methods are either domain specific or expensive. We have developed an approach to permanent fault isolation. In high-level synthesis that enables isolation through algorithmic application without necessitating complete functional unit replication. Fault identification is achieved through a unique binding methodology based on an extension of parity-like error correction equations in the domain of functional units. The result is an automated chip level approach with extremely low area and cost overhead.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116701608","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 communication-induced checkpointing protocol that ensures rollback-dependency trackability","authors":"R. Baldoni, J. Hélary, A. Mostéfaoui, M. Raynal","doi":"10.1109/FTCS.1997.614079","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614079","url":null,"abstract":"Considering an application in which processes take local checkpoints independently (called basic checkpoints), this paper develops a protocol that forces them to take some additional local checkpoints (called forced checkpoints) in order that the resulting checkpoint and communication pattern satisfies the Rollback Dependency Trackability (RDT) property. This property states that all dependencies between local checkpoints are on-line trackable by using a transitive dependency vector. Compared to other protocols ensuring the RDT property, the proposed protocol is less conservative in the sense that it takes less additional local checkpoints. It attains this goal by a subtle tracking of causal dependencies on already taken checkpoints; this tracking is then used to prevent the occurrence of hidden dependencies. As indicated by simulation study, the proposed protocol compares favorably with other protocols; moreover it additionally associates on-the-fly with each local checkpoint C the minimum global checkpoint to which C belongs.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132037396","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":"Using non-volatile storage to improve the reliability of RAID5 disk arrays","authors":"Robert Y. Hou, Y. Patt","doi":"10.1109/FTCS.1997.614093","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614093","url":null,"abstract":"RAID5 disk arrays are becoming popular solutions for providing fast access to data for transaction processing applications. They provide good performance at low cost without sacrificing much data reliability. Their main drawback is poor performance for small write requests. Techniques for using non-volatile RAM (NVRAM) have been proposed for improving the performance of these write requests. The paper shows that NVRAM and other nonvolatile devices can also be used to improve the reliability of an array by significantly reducing the time required to repair a failed disk: in the array in the event of a single disk failure. More importantly, proper use of these non-volatile devices allows the array to support heavier workloads than previously reported yet still repair a failed disk in a reasonable amount of time.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116942199","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":"Experimental evaluation of failure-detection schemes in real-time communication networks","authors":"Seungjae Han, K. Shin","doi":"10.1109/FTCS.1997.614085","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614085","url":null,"abstract":"An effective failure-detection scheme is essential for reliable communication services. Most computer network rely on behavior-based detection schemes: each node uses heartbeats to detect the failure of its neighbor nodes, and the transport protocol (like TCP) achieves reliable communication by acknowledgment/retransmission. In this paper, we experimentally evaluate the effectiveness of such behavior-based detection schemes in real-time communication. Specifically, we measure and analyze the coverage and latency of two failure-detection schemes-neighbor detection and end-to-end detection-through fault-injection experiments. The experimental results have shown that a significant portion of failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116087655","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":"ACTIV-LOCSTEP: a test generation procedure based on logic simulation and fault activation","authors":"I. Pomeranz, S. Reddy","doi":"10.1109/FTCS.1997.614087","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614087","url":null,"abstract":"We present a test generation procedure for synchronous sequential circuits referred to as ACTIV-LOCSTEP. Like its predecessor LOCSTEP, ACTN-LOCSTEP generates test sequences at low computational costs by using randomized search and avoiding fault oriented test generation. However, ACTIV-LOCSTEP is fundamentally different from LOCSTEP, being based on the following observation. Consider an input sequence C that consists of a transient C/sub 1/, followed by a periodic part C/sub 2/ that takes the fault free circuit through a cycle of states. Suppose that a fault f is activated during the cycle. If the same input sequence does not create a cycle in the faulty circuit, or creates a cycle of a different length than the one traversed by the fault free circuit, then f is likely to be detected after several repetitions of C/sub 2/ In the resulting procedure, the test sequence length is controlled by restricting the length of the input sequence C and the number of repetitions of the periodic part. Our experiments indicate that relatively short sequences and small numbers of repetitions of the periodic part of the sequence allow large numbers of faults to be detected.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130856035","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":"Toward accessibility enhancement of dependability modeling techniques and tools","authors":"A. Tai, H. Hecht, Kishor S. Trivedi, Bing Zhang","doi":"10.1109/FTCS.1997.614075","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614075","url":null,"abstract":"Although various dependability evaluation techniques and tools have been developed in the last two decades, no adequate attention has been paid to allow system designers not well versed in analytic modeling to easily employ these techniques and tools. In this paper, we report our experiences on accessibility enhancement for off-the-shelf modeling techniques and tools. In particular, we discuss our approaches to the development of a user-friendly dependability-evaluation workbench which is intended to lead the user to exploit the features and capabilities of the modeling tool SHARPE.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129291202","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 lightweight solution to uniform atomic broadcast for asynchronous systems","authors":"E. Anceaume","doi":"10.1109/FTCS.1997.614102","DOIUrl":"https://doi.org/10.1109/FTCS.1997.614102","url":null,"abstract":"Chandra and Toueg (1993) proposed a new approach to overcome the impossibility of reaching deterministically Consensus-and by corollary Atomic Broadcast-in asynchronous systems subject to crash failures. They augment the asynchronous system with a possibly Unreliable Failure Detector which provides some information about the operational state of processes. In this paper, we present an extension of the Consensus problem that we call Uniform Prefix Agreement. This extension enables all the processes to propose a flow of messages during an execution-instead of one as in the Consensus problem-and uses all these proposed messages to compose its decision value. Prefix Agreement is based on an Unreliable Failure Detectors. We use repeated executions of Prefix Agreement to build an efficient and lightweight Uniform Atomic Broadcast algorithm. This paper describes the Uniform Prefix Agreement and Uniform Atomic Broadcast algorithms.","PeriodicalId":158013,"journal":{"name":"Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129529111","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}