一种分层式2PC协议通信算法研究

Study on a Communication Algorithm of Hierarchical 2PC Protocol

针对分布式数据库系统的分层式2PC协议提出了一种实用的通信算法——通信树算法。该算法关于结点数N所用时间为O(ln(N))阶。其基本思想是给除通信源节点外的其它参与节点分配适量的通信工作，减少发送源结点的工作量，以达到缩短系统响应时间的目的。文章给出了通信树的构造算法和通信时间函数，最后列出了不同结点数的几个主要通信时间参数比较数据。

Based on 2PC protocol in distributed database system, this paper presents a practical communication algorithm——communication tree algorithm. With the number of nodes N, the algorithm shrinks the communication time to O(ln(N)). The basic thought is to assign proper work to the other nodes besides the communication source node, and so shorten the system responding time. Then it gives the algorithm to construct the communication tree and time function. Finally it lists some main kinds of data relative to system responding time.