{"title":"Managing replicated data in heterogeneous database systems","authors":"Jian Tang","doi":"10.1109/RELDIS.1992.235147","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235147","url":null,"abstract":"In a heterogeneous database system, supporting transaction semantics is expensive, and sometimes impossible. thus, in such systems, traditional methods such as quorum consensus cannot be used directly for managing replicated data. A method to manage replicated data in a heterogeneous database system is proposed. The method is based on the idea of quorum consensus but does not rely on transaction semantics. It is more robust than the other methods introduced in the literature, and can be used in systems where one copy serializability is the correctness criteria.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124175605","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":"Optimistic message logging for independent checkpointing in message-passing systems","authors":"Yi-Min Wang, W. Fuchs","doi":"10.1109/RELDIS.1992.235132","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235132","url":null,"abstract":"Message-passing systems with a communication protocol transparent to the applications typically require message logging to ensure consistency between checkpoints. A periodic independent checkpointing scheme with optimistic logging to reduce performance degradation during normal execution while keeping the recovery cost acceptable is described. Both time and space overhead for message logging can be reduced by detecting messages that need not be logged. A checkpoint space reclamation algorithm is presented to reclaim all checkpoints which are not useful for any possible future recovery. Communication trace-driven simulation for several hypercube programs is used to evaluate the techniques.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918882","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 multi-paradigm programming language for constructing fault-tolerant, distributed systems","authors":"R. Schlichting, V. Thomas","doi":"10.1109/RELDIS.1992.235123","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235123","url":null,"abstract":"The design of FT-SR, a programming language based on SR and oriented toward constructing fault-tolerant distributed systems, is presented. The language, which is based on the existing SR language, is unique in that it has been designed to support equally well any of the programming paradigms that have been developed for this type of system, including the object/action model, the restartable action paradigm, and the state machine approach. To do this, the language is designed to support the implementation of systems modeled as collections of fail-stop atomic objects. Such objects execute operations as atomic actions except when a failure or series of failures cause underlying implementation assumptions to be violated; in this case, notification is provided. An example program consisting of a data manager and its associated stable storage is given.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122168745","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}
K. Kim, H. Kopetz, K. Mori, E. Shokri, G. Grünsteidl
{"title":"An efficient decentralized approach to processor-group membership maintenance in real-time LAN systems: the PRHB/ED scheme","authors":"K. Kim, H. Kopetz, K. Mori, E. Shokri, G. Grünsteidl","doi":"10.1109/RELDIS.1992.235140","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235140","url":null,"abstract":"In constructing highly reliable LAN systems, a mechanism that enables every active node to maintain timely and consistent knowledge about the health status of all cooperating nodes can be used as a cornerstone. The authors consider the case where maintenance of such knowledge is achieved in a decentralized manner and timely and consistent recognition of newly joining nodes is also facilitated. The authors develop an optimal version of H. Kopetz et al.'s (1985) periodic reception history broadcast (PRHB) method. The authors' version enables detection of failures with minimum latency and is called the PRHB with earliest detection (PRHB/ED). This scheme has much shorter latency than the previous PRHB scheme and is yet equally practical in the sense that it does not increase the communication traffic at all, and the complexity of the algorithm for analyzing the observations exchanged among the active nodes is still bounded by a linear function of the number of nodes in the system.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126668030","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":"Global checkpointing for distributed programs","authors":"L. Silva, J. G. Silva","doi":"10.1109/RELDIS.1992.235131","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235131","url":null,"abstract":"A novel algorithm for checkpointing and rollback recovery in distributed systems is presented. Processes belonging to the same program must take periodically a nonblocking coordinated global checkpoint, but only a minimum overhead is imposed during normal computation. Messages can be delivered out of order, and the processes are not required to be deterministic. The nonblocking structure is an important characteristic for avoiding laying a heavy burden on the application programs. The method also includes the damage assessment phase, unlike previous schemes that either assume that an error is detected immediately after it occurs (fail-stop) or simply ignore the damage caused by imperfect detection mechanisms. A possible way to evaluate the error detection latency, which enables one to assess the damage made and avoid the propagation of errors, is presented.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126231360","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":"Neural networks for the design of distributed, fault-tolerant, computing environments","authors":"R. Geist, D. Suggs","doi":"10.1109/RELDIS.1992.235127","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235127","url":null,"abstract":"Binary optimization models for the design of distributed, fault-tolerant computing systems are considered, with a focus on the task allocation and file assignment modeling schema proposed by J. Bannister and K. Trivedi (Proc. Second Symp. on Reliability in Distributed Software and Database Systems, 1982). It is shown that R. Graham's (1969) partitioning algorithm, S, when applied to this schema can, in the case of finite resources, yield allocations that are arbitrarily poor with respect to the optimum allocation. This contrasts sharply with the case of ample resources, where S provides allocations that are provably close to the optimum. Two alternative allocation algorithms are suggested. Both are seen to deliver allocations preferable to those provided by S, but at some additional computational expense.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686296","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":"Error attenuation in distributed systems","authors":"Krassimir Djambazov, Stephan Panayotov","doi":"10.1109/RELDIS.1992.235143","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235143","url":null,"abstract":"A method for achieving fault-tolerance in distributed systems is proposed and compared with the known method of error masking based on distributed voting over the results of several variants. The method is called error attenuation, since the errors produced by nonpermanent faults attenuate eventually during the further execution of the variants. The term attenuation is used to represent the fact that error masking is obtained not in one step, but gradually, in several steps. The proposed method for error attenuation is studied for systems with distributed majority voting and with distributed plurality voting, and for systems implementing adaptive strategy.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130594808","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":"The performance of consistent checkpointing","authors":"E. Elnozahy, David B. Johnson, W. Zwaenepoel","doi":"10.1109/RELDIS.1992.235144","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235144","url":null,"abstract":"Consistent checkpointing provides transparent fault tolerance for long-running distributed applications. Performance measurements of an implementation of consistent checkpointing are described. The measurements show that consistent checkpointing performs remarkably well. Eight computation-intensive distributed applications were executed on a network of 16 diskless Sun-3/60 workstations, and the performance without checkpointing was compared to the performance with consistent checkpoints taken at two-minute intervals. For six of the eight applications, the running time increased by less than 1% as a result of the checkpointing. The highest overhead measured was 5.8%. Incremental checkpointing and copy-on write checkpointing were the most effective techniques in lowering the running time overhead. It is argued that these measurements show that consistent checkpointing is an efficient way to provide fault tolerance for long-running distributed applications.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123070817","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":"The two-phase commit performance of the DECdtm services","authors":"E. Zimran","doi":"10.1109/RELDIS.1992.235145","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235145","url":null,"abstract":"The performance of the two-phase commit protocols implemented by Digital Equipment Corporation's (DEC)'s distributed transaction manager (DECdtm V1.1) is characterized. Throughput, response time, resource utilization and other performance aspects of reliable distributed transactions are analyzed. Efficient implementation and effective group-commit allowed DECdtm to reach up to 176 transactions per second on a single VAX8700 (6 VUPs) processor, and up to 76 distributed transactions per second between two VAX8700 nodes.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130827209","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":"On the verification and validation of protocols with high fault coverage using UIO sequences","authors":"Xiao Sun, Yinan N. Shen, F. Lombardi","doi":"10.1109/RELDIS.1992.235126","DOIUrl":"https://doi.org/10.1109/RELDIS.1992.235126","url":null,"abstract":"Various new classes of unique input/output (UIO) sequences for verification and validation (conformance testing) of protocols modeled as finite state machines (FSMs) are presented. The proposed sequences are referred to as adaptive because test sequence generation is not a mere concatenation of test subsequences for all edges of the FSM, but rather subsequences are concatenated using appropriate conditions in the UIO sequence for length minimization and no degradation of fault coverage.<<ETX>>","PeriodicalId":214473,"journal":{"name":"[1992] Proceedings 11th Symposium on Reliable Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121103276","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}