通用混合数据复制协议的读写可用性分析

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI:10.1109/PRDC.2004.1276565

M. Arai, Tabito Suzuki, Mamoru Ohara, S. Fukumoto, K. Iwasaki, H. Youn

{"title":"通用混合数据复制协议的读写可用性分析","authors":"M. Arai, Tabito Suzuki, Mamoru Ohara, S. Fukumoto, K. Iwasaki, H. Youn","doi":"10.1109/PRDC.2004.1276565","DOIUrl":null,"url":null,"abstract":"Replicating data is a promising way of improving the dependability of large distributed systems. The hybrid data replication protocol combines concepts of the tree quorum protocol and grid protocol. We present an analytical evaluation of read/write availability for the generalized hybrid data replication protocol, which extends the arrangement of nodes into a more general form to improve write availability. The average number of nodes accessed for read/write operations is also analyzed under the assumption that nodes might fail. Equations are derived based on node availability p, and numerical examples are shown. We use computer simulations to estimate the throughput for read/write operations.","PeriodicalId":383639,"journal":{"name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Analysis of read and write availability for generalized hybrid data replication protocol\",\"authors\":\"M. Arai, Tabito Suzuki, Mamoru Ohara, S. Fukumoto, K. Iwasaki, H. Youn\",\"doi\":\"10.1109/PRDC.2004.1276565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Replicating data is a promising way of improving the dependability of large distributed systems. The hybrid data replication protocol combines concepts of the tree quorum protocol and grid protocol. We present an analytical evaluation of read/write availability for the generalized hybrid data replication protocol, which extends the arrangement of nodes into a more general form to improve write availability. The average number of nodes accessed for read/write operations is also analyzed under the assumption that nodes might fail. Equations are derived based on node availability p, and numerical examples are shown. We use computer simulations to estimate the throughput for read/write operations.\",\"PeriodicalId\":383639,\"journal\":{\"name\":\"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2004.1276565\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2004.1276565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

复制数据是提高大型分布式系统可靠性的一种很有前途的方法。混合数据复制协议结合了树仲裁协议和网格协议的概念。我们提出了一种通用混合数据复制协议的读/写可用性分析评估，该协议将节点的安排扩展为更通用的形式，以提高写可用性。在假设节点可能出现故障的情况下，还分析了读写操作访问的平均节点数。推导了基于节点可用性p的方程，并给出了数值算例。我们使用计算机模拟来估计读/写操作的吞吐量。

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

查看原文本刊更多论文

Analysis of read and write availability for generalized hybrid data replication protocol

Replicating data is a promising way of improving the dependability of large distributed systems. The hybrid data replication protocol combines concepts of the tree quorum protocol and grid protocol. We present an analytical evaluation of read/write availability for the generalized hybrid data replication protocol, which extends the arrangement of nodes into a more general form to improve write availability. The average number of nodes accessed for read/write operations is also analyzed under the assumption that nodes might fail. Equations are derived based on node availability p, and numerical examples are shown. We use computer simulations to estimate the throughput for read/write operations.

求助全文

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

来源期刊

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.

自引率

0.00%

发文量