{"title":"Performance of Approximate Causal Consistency for Partially Replicated Systems","authors":"T. Hsu, A. Kshemkalyani","doi":"10.1145/2962564.2962572","DOIUrl":null,"url":null,"abstract":"Causal consistency is one of the widely used consistency models in wide-area replicated systems due to highly scalable semantics. Partial replication is a replication mechanism that emphasizes a better network capacity utilization. However, it has a challenge of higher meta-data overhead and processing complexity in communication. Algorithm Approx-Opt-Track has been proposed to reduce meta-data size, however, by risking that causal consistency might be violated. In an effort to bridge this gap and reconcile the trade-off between them, we present the analytic data to show the performance of Approx-Opt-Track. We also give simulation results to show the potential benefits of Approx-Opt-Track, under almost the same guarantees as causal consistency, at a smaller cost. The results indicate that partial replication is a potentially viable alternative to full replication for implementing causal consistency.","PeriodicalId":235870,"journal":{"name":"Proceedings of the Third International Workshop on Adaptive Resource Management and Scheduling for Cloud Computing","volume":"78 s346","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third International Workshop on Adaptive Resource Management and Scheduling for Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2962564.2962572","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Causal consistency is one of the widely used consistency models in wide-area replicated systems due to highly scalable semantics. Partial replication is a replication mechanism that emphasizes a better network capacity utilization. However, it has a challenge of higher meta-data overhead and processing complexity in communication. Algorithm Approx-Opt-Track has been proposed to reduce meta-data size, however, by risking that causal consistency might be violated. In an effort to bridge this gap and reconcile the trade-off between them, we present the analytic data to show the performance of Approx-Opt-Track. We also give simulation results to show the potential benefits of Approx-Opt-Track, under almost the same guarantees as causal consistency, at a smaller cost. The results indicate that partial replication is a potentially viable alternative to full replication for implementing causal consistency.