From: Sébastien Miquée <sebastien.miquee@univ-fcomte.fr>
Date: Wed, 24 Feb 2010 12:54:37 +0000 (+0100)
Subject: Implementation of fault tolerance functions in all algorithms.
X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/mapping.git/commitdiff_plain/98acbcc2ea6af60d64b96cd46c4eb446e03a7510?hp=98acbcc2ea6af60d64b96cd46c4eb446e03a7510

Implementation of fault tolerance functions in all algorithms.

- In DefaultMapping, it returns in both cases the next node in the list.

- In QM, it returns the best computing power node for the replacement,
  and a node from the cluster which has the most amount of free nodes
  for another node.

- In LSM (Edge-cuts), it returns the nearest node for the replacement,
  and a node from the cluster which has the most amount of free nodes
  for another node.

- Simple does the same thing as DefaultMapping.
---