Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Fast Computation by Population Protocols With a Dana Angluin1

Summary: Fast Computation by Population Protocols With a
Dana Angluin1
, James Aspnes1
, and David Eisenstat2
Yale University, Department of Computer Science
Princeton University, Department of Computer Science
Abstract. Fast algorithms are presented for performing computations in a prob-
abilistic population model. This is a variant of the standard population proto-
col model--in which finite-state agents interact in pairs under the control of an
adversary scheduler--where all pairs are equally likely to be chosen for each
interaction. It is shown that when a unique leader agent is provided in the ini-
tial population, the population can simulate a virtual register machine in which
standard arithmetic operations like comparison, addition, subtraction, and multi-
plication and division by constants can be simulated in O(n log4
n) interactions
with high probability. Applications include a reduction of the cost of computing a
semilinear predicate to O(n log4


Source: Aspnes, James - Department of Computer Science, Yale University


Collections: Computer Technologies and Information Sciences