Optimistic Paradigm for Distributed Computing

本研究主要关注分布式 算法，特别是当它们涉及到性能和 分布式系统的可靠性。 它涉及到 分布式算法的发展是基于乐观的 范例 乐观算法已经被开发出来， 解决系统中的回滚和并发问题。 的 针对复制数据提出的算法显著减少了 事务由于复制副本和并发而产生的延迟 控制 本文提出了分析和评价 这些算法，并建立一个测试平台，这些算法可以 实行 我们的目标是开发一个通用框架， 用于从其集中的 同行

The proposed research is primarily concerned with distributed algorithms, particularly as they relate to the performance and reliability of distributed systems. It is involved with the development of distributed algorithms that are based on the optimistic paradigm. Optimistic algorithms have been developed that particularly address the issues of rollback and concurrency in the system. The proposed algorithms for replicated data significantly reduce the latency incurred by transactions due to replica and concurrency control. It is proposed to analyze and evaluate the performance of these algorithms and to build a testbed in which these algorithms can be implemented. The goal is to develop a general framework that can be used to synthesize optimistic protocols from their centralized counterparts.