原子提交的最佳通信拓扑

Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI:10.1109/ICDE.1988.105445

A. Segall, O. Wolfson

{"title":"原子提交的最佳通信拓扑","authors":"A. Segall, O. Wolfson","doi":"10.1109/ICDE.1988.105445","DOIUrl":null,"url":null,"abstract":"The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a 'better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"131 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal communication topologies for atomic commitment\",\"authors\":\"A. Segall, O. Wolfson\",\"doi\":\"10.1109/ICDE.1988.105445\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a 'better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT.<<ETX>>\",\"PeriodicalId\":243420,\"journal\":{\"name\":\"Proceedings. Fourth International Conference on Data Engineering\",\"volume\":\"131 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Fourth International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1988.105445\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Fourth International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1988.105445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

作者认为分布式算法以最小的通信成本实现交易承诺，但在达成共识所需的时间上有所不同。基于这一标准，作者定义了最小通信成本算法的“优于”部分排序。他们还讨论了之前介绍的一种简单的、最小通信成本算法的替代方案，称为TREE-COMMIT. b>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal communication topologies for atomic commitment

The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a 'better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. Fourth International Conference on Data Engineering

自引率

0.00%

发文量