{"title":"An open commit protocol preserving consistency in the presence of commission failures","authors":"K. Rothermel","doi":"10.1109/ICDCS.1993.287711","DOIUrl":null,"url":null,"abstract":"Most of the proposed commit protocols assume that all participants of a transaction are sane, i.e., they only fail with omission failures and eventually recover. Unfortunately, this assumption is not realistic for open distributed systems (ODSs), which can be divided into a trusted and a nontrusted domain. While nodes in the trusted domain are assumed to be sane, nontrusted nodes may fail permanently and with commission failures. The open commit protocols presented are based on a model for consistency checking. The protocol also tolerates any number of commission failures in the nontrusted domain of an ODS. It guarantees that the trusted participants of a transaction terminate in a way that preserves consistency in the trusted domain, which generally does not mean that all trusted participants have to terminate consistently. The protocol groups those trusted participants that have to terminate consistently to maintain data consistency, and ensures that in each group the participants terminate in the same way. The advantages of the protocol are a simplified commit processing and a reduced message complexity. The message complexity of this protocol exceeds that of traditional two-phase commit protocols by no more than two messages for most practical cases.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1993.287711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Most of the proposed commit protocols assume that all participants of a transaction are sane, i.e., they only fail with omission failures and eventually recover. Unfortunately, this assumption is not realistic for open distributed systems (ODSs), which can be divided into a trusted and a nontrusted domain. While nodes in the trusted domain are assumed to be sane, nontrusted nodes may fail permanently and with commission failures. The open commit protocols presented are based on a model for consistency checking. The protocol also tolerates any number of commission failures in the nontrusted domain of an ODS. It guarantees that the trusted participants of a transaction terminate in a way that preserves consistency in the trusted domain, which generally does not mean that all trusted participants have to terminate consistently. The protocol groups those trusted participants that have to terminate consistently to maintain data consistency, and ensures that in each group the participants terminate in the same way. The advantages of the protocol are a simplified commit processing and a reduced message complexity. The message complexity of this protocol exceeds that of traditional two-phase commit protocols by no more than two messages for most practical cases.<>