/**
- * Implementation of Simple Mapping algorithm
+ * Implementation of the Simple Mapping algorithm (no fault tolerance mechanism)
* @author Sébastien Miquée
* @version 1.0
*/
public Simple()
{
super() ;
+ name = "Simple" ;
}
public Simple( Graph _gr, Grid _gd )
{
super( _gr, _gd ) ;
+
+ name = "Simple" ;
}
/**
{
grn = new ArrayList<GNode>() ;
- // Tri des clusters suivant leur taille
+ // Sorting clusters according to their "size"
ArrayList<Cluster> cl = gl.getClusters() ;
ArrayList<Cluster> cl2 = new ArrayList<Cluster>() ;
/** Save the Mapping **/
for( int i = 0 ; i < atraiter.size() ; i++ )
{
- mp.addMapping( new Association( archi.get( i ), atraiter.get( i ) ) ) ;
+ mp.addMapping( archi.get( i ), atraiter.get( i ) ) ;
}
} else {
System.err.println( "\n\n!!! Unable to map application !\n\n" ) ;
}
- /** Update in cluster the status of nodes **/
- updateGrid() ;
}
} else {
System.err.println( "Not enought available nodes in gnodes to replace one !" ) ;
return null ;
- }
+ }
+
+ nb_fault++ ;
}
- /** Update in cluster the status of nodes **/
- updateGrid() ;
-
return ret ;
}
return null ;
}
+
+
+ @Override
+ public boolean setParams(Object[] _params) {
+ return true ;
+ }
}