X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/mapping.git/blobdiff_plain/919cd5f7e473b8b22b46a6b6c221341ca8cd738b..298037f8cd008787c5cfe493ba582ac64bbbc3a2:/javadoc/and/Mapping/QM.html diff --git a/javadoc/and/Mapping/QM.html b/javadoc/and/Mapping/QM.html new file mode 100644 index 0000000..35aaa2c --- /dev/null +++ b/javadoc/and/Mapping/QM.html @@ -0,0 +1,359 @@ + + + + + + +QM + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + +
+ +
+ + + +
+ +

+ +and.Mapping +
+Class QM

+
+java.lang.Object
+  extended by and.Mapping.Algo
+      extended by and.Mapping.QM
+
+
+
All Implemented Interfaces:
java.io.Serializable
+
+
+
+
public class QM
extends Algo
+ + +

+Implementation of the AIAC Quick Quality Map (AIAC-QM) algorithm +

+ +

+

+
Version:
+
1.0
+
Author:
+
Sébastien Miquée
+
See Also:
Serialized Form
+
+ +

+ + + + + + + + + + + + + + +
+Constructor Summary
QM() + +
+          Default constructor.
QM(Graph _gr, + Grid _gd, + double _f) + +
+          Constructor
+  + + + + + + + + + + + + + + + + + + + +
+Method Summary
+ GNodegetOtherGNode() + +
+          Find a new node, which may not takes part into the computation process.
+ voidmap() + +
+          Mapping function.
+ GNodereplaceNode(GNode _dead, + java.util.ArrayList<GNode> _ag) + +
+          Replace a fallen node by a new one, according to the mapping policy.
+ + + + + + + +
Methods inherited from class and.Mapping.Algo
getMapping
+ + + + + + + +
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
+  +

+ + + + + + + + +
+Constructor Detail
+ +

+QM

+
+public QM()
+
+
Default constructor. +

+

+
+ +

+QM

+
+public QM(Graph _gr,
+          Grid _gd,
+          double _f)
+
+
Constructor +

+

+
Parameters:
_gr - Application graph to be mapped on
_gd - Grid graph
_f - Search factor
+
+ + + + + + + + +
+Method Detail
+ +

+map

+
+public void map()
+
+
Description copied from class: Algo
+
Mapping function. +

+

+
Specified by:
map in class Algo
+
+
+
+
+
+
+ +

+replaceNode

+
+public GNode replaceNode(GNode _dead,
+                         java.util.ArrayList<GNode> _ag)
+
+
Description copied from class: Algo
+
Replace a fallen node by a new one, according to the mapping policy. +

+

+
Specified by:
replaceNode in class Algo
+
+
+
Parameters:
_dead - The fallen node to be replaced
_ag - The list of all available computing nodes +
Returns:
The new node
+
+
+
+ +

+getOtherGNode

+
+public GNode getOtherGNode()
+
+
Description copied from class: Algo
+
Find a new node, which may not takes part into the computation process. + Typically such kind of node is used to create a new spawner or a new super-node, + in order to bring fault tolerance. +

+

+
Specified by:
getOtherGNode in class Algo
+
+
+ +
Returns:
Another node which will not compute
+
+
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
+ + + +
+ + +