Checkpointing in a Distributed Coordination Protocol for Multiple Peer Processes
Checkpointing in a Distributed Coordination Protocol for Multiple Peer Processes
复制标题
多个对等进程的分布式协调协议中的检查点
DOI：
10.1109/aina.2008.148
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
M. Takizawa
中科院分区：
文献类型：
--
作者：
A. Aikebaier;T. Enokido;M. Takizawa
关于多进程的协议协议有很多讨论。然而，它们的目标只是在过程所显示的价值中达成一致。在人类社会中，协议程序是灵活的，人们可以改变自己的意见，可以使用各种类型的协议条件。在本文中，我们通过考虑社会协议过程中的人类行为，讨论了一种更灵活的多对等过程协议协议。每个进程首先在域Di中获取一个值v，这是一个可能值的集合，并将值v通知其他进程。一个进程依次从其他进程接收值。除非来自所有进程的一组值满足一个协议条件，否则进程可以取另一个值v'。为了模拟人们的社会行为，我们已经讨论了E-和p -先例关系的价值观。为了有效地达成协议，我们必须讨论一些多进程的协调机制。如果进程pi发现它选择了一个不正确的值，它会想要从前一轮重新开始。进程pi每轮需要一个检查点。然后，进程pi可以回滚到前一个检查点轮。此外，对一个值有一些约束。如果一个进程说了某个值，该进程就不能提取该值，即不能回滚。基于先例关系和检查点，一组进程有效地达成协议。
There are many discussions on agreement protocols of multiple processes. However, they just aim at agreeing one value out of values shown by the processes. In human societies, agreement procedures are flexible, person can change their opinions and can use various type of agreement conditions. In this paper, we discuss a more flexible agreement protocol of multiple peer processes by taking account the human behaviour in social agreement procedures. Each process first takes a value v in a domain Di which is a collection of possible values and notifies the other processes of the value v. A process in turn receives values from other processes. Unless a set of the values from all the processes satisfy an agreement condition, a process can take another value v'. In order to model the social behaviour of people, we already discuss E- and P-precedent relations on values. In order to efficiently make an agreement, we have to discuss some coordination mechanism of multiple processes. A process pi would like to start over from a previous round if pi finds it to have selected an improper value. The process pi takes a checkpoint at a round. Then, the process pi can roll back to the previous checkpointed round. In addition, there are some constraints on a value. If a process says some value, the process cannot withdraw the value, i.e. cannot roll back. Based on the precedent relations and checkpoints, a group of processes efficiently make an agreement.