solution_size     777 ompi/mca/topo/treematch/treematch/tm_tree.c static int thread_derecurs_exhaustive_search(group_list_t **tab_group, int i, int nb_groups, int arity, int depth, int solution_size,
solution_size     787 ompi/mca/topo/treematch/treematch/tm_tree.c   nb_groups_to_find = solution_size - depth;
solution_size     789 ompi/mca/topo/treematch/treematch/tm_tree.c   if( depth == solution_size ){
solution_size     791 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, solution_size, arity, val);
solution_size     797 ompi/mca/topo/treematch/treematch/tm_tree.c       for( i = 0 ; i < solution_size ; i++ )
solution_size     850 ompi/mca/topo/treematch/treematch/tm_tree.c     nb_groups_to_find = solution_size - depth;
solution_size     933 ompi/mca/topo/treematch/treematch/tm_tree.c   int solution_size = *(int*) args[3];
solution_size     958 ompi/mca/topo/treematch/treematch/tm_tree.c   tab_i = (int*) MALLOC(sizeof(int)*solution_size);
solution_size     959 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
solution_size     999 ompi/mca/topo/treematch/treematch/tm_tree.c       thread_derecurs_exhaustive_search(tab_group, id+1, n, arity, work->nb_groups, solution_size, val, best_val, selection, best_selection, indep_mat, lock, thread_id, tab_i, work->nb_groups);
solution_size    1124 ompi/mca/topo/treematch/treematch/tm_tree.c static int thread_exhaustive_search(group_list_t **tab_group, int nb_groups, int arity, int solution_size, double *best_val,
solution_size    1183 ompi/mca/topo/treematch/treematch/tm_tree.c     args[3]=(void*)&solution_size;
solution_size    1220 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
solution_size    1230 ompi/mca/topo/treematch/treematch/tm_tree.c static int old_recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat)
solution_size    1236 ompi/mca/topo/treematch/treematch/tm_tree.c   if( d == solution_size ){
solution_size    1238 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, solution_size, arity, val);
solution_size    1241 ompi/mca/topo/treematch/treematch/tm_tree.c       for( i = 0 ; i < solution_size ; i++ )
solution_size    1248 ompi/mca/topo/treematch/treematch/tm_tree.c   if(solution_size-d>n-i){ /*if there not enough groups available*/
solution_size    1260 ompi/mca/topo/treematch/treematch/tm_tree.c 	old_recurs_exhaustive_search(tab, i+1, n, arity, d+1, solution_size, val, best_val, selection, best_selection, indep_mat);
solution_size    1272 ompi/mca/topo/treematch/treematch/tm_tree.c static int recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat, int* tab_i)
solution_size    1277 ompi/mca/topo/treematch/treematch/tm_tree.c   if( d == solution_size ){
solution_size    1279 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, solution_size, arity, val);
solution_size    1282 ompi/mca/topo/treematch/treematch/tm_tree.c       for( i = 0 ; i < solution_size ; i++ )
solution_size    1289 ompi/mca/topo/treematch/treematch/tm_tree.c   if(solution_size-d>n-i){ /*if there not enough groups available*/
solution_size    1325 ompi/mca/topo/treematch/treematch/tm_tree.c static int  exhaustive_search(group_list_t **tab_group, int n, int arity, int solution_size, double *best_val,
solution_size    1336 ompi/mca/topo/treematch/treematch/tm_tree.c   int *tab_i = (int*) MALLOC(sizeof(int)*solution_size);
solution_size    1353 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
solution_size    1362 ompi/mca/topo/treematch/treematch/tm_tree.c     old_recurs_exhaustive_search(tab_group, i+1, n, arity, 1, solution_size, val, best_val, selection, best_selection, indep_mat);
solution_size    1378 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
solution_size    1388 ompi/mca/topo/treematch/treematch/tm_tree.c int  select_independent_groups_by_largest_index(group_list_t **tab_group, int n, int arity, int solution_size, double *best_val, group_list_t **best_selection, int bound, double max_duration)
solution_size    1395 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
solution_size    1402 ompi/mca/topo/treematch/treematch/tm_tree.c     nb_groups += test_independent_groups(tab_group, i+1, n, arity, 1, solution_size, val, best_val, selection, best_selection);
solution_size    1423 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
solution_size    1556 ompi/mca/topo/treematch/treematch/tm_tree.c double fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size, double nb_groups)
solution_size    1563 ompi/mca/topo/treematch/treematch/tm_tree.c   for( l = 0 ; l < solution_size ; l++ ){
solution_size    1569 ompi/mca/topo/treematch/treematch/tm_tree.c     fast_group(aff_mat, tab_node, &new_tab_node[l], -1, arity, 0, &best_val, cur_group, &nb_done, MAX(10, (int)(50-CmiLog2(nb_groups))-solution_size/10));
solution_size    1586 ompi/mca/topo/treematch/treematch/tm_tree.c static double k_partition_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size) {
solution_size    1597 ompi/mca/topo/treematch/treematch/tm_tree.c     printf("K-Partitionning: n=%d, solution_size=%d, arity=%d\n",n, solution_size,arity);
solution_size    1599 ompi/mca/topo/treematch/treematch/tm_tree.c   partition = kpartition(solution_size, &com_mat, n, NULL, 0);
solution_size    1603 ompi/mca/topo/treematch/treematch/tm_tree.c   int *j_tab = (int*) CALLOC(solution_size,sizeof(int));
solution_size    1613 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i = 0 ; i < solution_size ; i++ ){
solution_size    1647 ompi/mca/topo/treematch/treematch/tm_tree.c void super_fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size)
solution_size    1685 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i = 0 ; (i < e) && (l < solution_size) ; i++ )
solution_size    1689 ompi/mca/topo/treematch/treematch/tm_tree.c   for( l = 0 ; l < solution_size ; l++ ){
solution_size    1703 ompi/mca/topo/treematch/treematch/tm_tree.c   display_grouping(new_tab_node, solution_size, arity, val);
solution_size    1763 ompi/mca/topo/treematch/treematch/tm_tree.c 		 int arity, int solution_size, double* obj_weigth, double comm_speed){
solution_size    1804 ompi/mca/topo/treematch/treematch/tm_tree.c       val = bucket_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size);
solution_size    1808 ompi/mca/topo/treematch/treematch/tm_tree.c       val = fast_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size, nbg);
solution_size    1812 ompi/mca/topo/treematch/treematch/tm_tree.c       val = k_partition_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size);
solution_size    1820 ompi/mca/topo/treematch/treematch/tm_tree.c       display_grouping(new_tab_node, solution_size, arity, val);
solution_size    1829 ompi/mca/topo/treematch/treematch/tm_tree.c     best_selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
solution_size    1843 ompi/mca/topo/treematch/treematch/tm_tree.c     timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 1, 100);
solution_size    1859 ompi/mca/topo/treematch/treematch/tm_tree.c     timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1);
solution_size    1872 ompi/mca/topo/treematch/treematch/tm_tree.c     timeout=select_independent_groups_by_largest_index(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1);
solution_size    1899 ompi/mca/topo/treematch/treematch/tm_tree.c       timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1);
solution_size    1915 ompi/mca/topo/treematch/treematch/tm_tree.c       thread_exhaustive_search(tab_group, nb_groups, arity, solution_size, &best_val, best_selection);
solution_size    1927 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(best_selection, solution_size, sizeof(group_list_t*), group_list_id);
solution_size    1929 ompi/mca/topo/treematch/treematch/tm_tree.c     for( l = 0 ; l < solution_size ; l++ ){