How to assign votes in a distributed system (Q3771671)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4031054
Language Label Description Also known as
default for all languages
No label defined
    English
    How to assign votes in a distributed system
    scientific article; zbMATH DE number 4031054

      Statements

      How to assign votes in a distributed system (English)
      0 references
      0 references
      0 references
      1985
      0 references
      distributed databases
      0 references
      distributed system
      0 references
      mutual exclusion
      0 references
      vote assignment
      0 references
      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.
      0 references

      Identifiers