|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object and.Mapping.Algo and.Mapping.LSM
public class LSM
Mapping algorithm based on the Edge-Cut principles
Field Summary |
---|
Fields inherited from class and.Mapping.Algo |
---|
gl, gr, mp |
Constructor Summary | |
---|---|
LSM()
Default constructor. |
|
LSM(Graph _gr,
Grid _gl)
Constructor. |
|
LSM(Graph _gr,
Grid _gl,
double _dep_min)
Constructor. |
Method Summary | |
---|---|
GNode |
getOtherGNode()
Find a new node, which may not takes part into the computation process. |
void |
map()
Mapping function. |
GNode |
replaceNode(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 |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public LSM()
public LSM(Graph _gr, Grid _gl)
_gr
- Application graph to be mapped on_gl
- Grid graphpublic LSM(Graph _gr, Grid _gl, double _dep_min)
_gr
- Application graph to be mapped on_gl
- Grid graph_dep_min
- Minimum amount of local dependenciesMethod Detail |
---|
public void map()
Algo
map
in class Algo
public GNode replaceNode(GNode _dead, java.util.ArrayList<GNode> _ag)
Algo
replaceNode
in class Algo
_dead
- The fallen node to be replaced_ag
- The list of all available computing nodes
public GNode getOtherGNode()
Algo
getOtherGNode
in class Algo
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |