ADSA

A-DSA : Asynchronous Distributed Stochastic Algorithm

ADSA [FM03] is an asynchronous version of DSA, the Distributed Stochastic Algorithm [ZWXW05] ( stochastic, local search DCOP algorithm.) Instead of waiting for its neighbors, each variables periodically determines if it should select a new values, based on the values received from its neighbors.

Algorithm Parameters

variant

‘A’, ‘B’ or ‘C’ ; the variant of the algorithm, as defined in [ZWXW05] . Defaults to B.

probability

probability of changing a value. Defaults to 0.7.

period

The period between variables’ activations, in seconds. Defaults to 0.5.

Example

pydcop -t 10 solve --algo adsa \
  --algo_param variant:B  \
  --algo_param probability:0.5 \
  --algo_param period:0.2
  graph_coloring_50.yaml

See also

DSA-tuto: for a very simple implementation of DSA, made for tutorials.

DSA: for a synchronous implementation of DSA.