How to assign votes in a distributed system
How to assign votes in a distributed system
复制标题
如何在分布式系统中分配选票
DOI：
10.1145/4221.4223
复制
发表时间：
1985
期刊：
影响因子：
--
通讯作者：
Daniel Barbará
中科院分区：
文献类型：
--
作者：
H. Garcia;Daniel Barbará
在分布式系统中，实现无需通信的节点组互斥的一种策略是为每个节点分配一定数量的选票。只有拥有多数票的群体才能执行关键操作，并且可以实现互斥，因为在任何给定时间最多有一个这样的群体。第二种策略似乎与投票类似，是先验地定义一组相互交叉的组。任何属于该集合的节点组都可以执行受限操作。在本文中，对这两种策略进行了详细研究，并表明它们通常并不等效（尽管在某些情况下是等效的）。这样做，证明了许多其他有趣的性质。这些属性对于为特定应用程序选择投票分配或一组组的系统设计者将很有用。
In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time there is at most one such group. A second strategy, which appears to be similar to votes, is to define a priori a set of groups that intersect each other. Any group of nodes that finds itself in this set can perform the restricted operations. In this paper, both of these strategies are studied in detail and it is shown that they are not equivalent in general (although they are in some cases). In doing so, a number of other interesting properties are proved. These properties will be of use to a system designer who is selecting a vote assignment or a set of groups for a specific application.