论文标题
技术报告：稳定与回滚的好处在最终一致的钥匙值商店中基于图形的应用程序中
Technical Report: Benefits of Stabilization versus Rollback in Self-Stabilizing Graph-Based Applications on Eventually Consistent Key-Value Stores
论文作者
论文摘要
在本文中，我们评估和比较两种方法的性能，即自动稳定和回滚，以处理违反故障（\ cvf）（\ cvf）时，这些方法是在最终一致一致的键值存储器上执行的基于自动化的分布式程序时发生的。违反故障的一致性是由于键值商店提供的一致性较弱而导致的错误值引起的。处理这些故障的一种方法是利用回滚，而另一种方法是依靠自稳定的财产，预计将提供从任意状态提供恢复。我们在不同的案例研究中评估了这两种方法 - 平面图着色，任意图形着色和最大匹配 - 以及不同的问题维度，例如输入数据特征，工作负载分区和网络延迟。我们还考虑使用不利用回滚的类似稳定算法执行非稳定算法的效果。
In this paper, we evaluate and compare the performance of two approaches, namely self-stabilization and rollback, to handling consistency violating faults (\cvf) that occur when a self-stabilizing distributed graph-based program is executed on an eventually consistent key-value store. Consistency violating faults are caused by reading wrong values due to weaker level of consistency provided by the key-value store. One way to deal with these faults is to utilize rollback whereas another way is to rely on the property of self-stabilization that is expected to provide recovery from arbitrary states. We evaluate both these approaches in different case studies --planar graph coloring, arbitrary graph coloring, and maximal matching-- as well as for different problem dimensions such as input data characteristics, workload partition, and network latency. We also consider the effect of executing non-stabilizing algorithm with rollback with a similar stabilizing algorithm that does not utilize rollback.
