oversub_fact 628 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->oversub_fact = 1; oversub_fact 851 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->oversub_fact = 1; oversub_fact 804 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c nb_cores=nb_processing_units(topology)*topology->oversub_fact; oversub_fact 476 ompi/mca/topo/treematch/treematch/tm_mapping.c assert(N==nb_compute_units*topology->oversub_fact); oversub_fact 488 ompi/mca/topo/treematch/treematch/tm_mapping.c for(j = 0 ; j < topology->oversub_fact ; j++){ oversub_fact 499 ompi/mca/topo/treematch/treematch/tm_mapping.c set_val(k[nodes_id[i/block_size]], proc_list[i], topology->oversub_fact); oversub_fact 518 ompi/mca/topo/treematch/treematch/tm_mapping.c for (j = 0 ; j<topology->oversub_fact; j++){ oversub_fact 542 ompi/mca/topo/treematch/treematch/tm_mapping.c k[i] = (int*) MALLOC(sizeof(int) * topology->oversub_fact); oversub_fact 551 ompi/mca/topo/treematch/treematch/tm_mapping.c solution->oversub_fact = topology->oversub_fact; oversub_fact 218 ompi/mca/topo/treematch/treematch/tm_solution.c for (j = 0 ; j<topology->oversub_fact; j++){ oversub_fact 87 ompi/mca/topo/treematch/treematch/tm_topology.c topology->oversub_fact = 1; oversub_fact 283 ompi/mca/topo/treematch/treematch/tm_topology.c res->oversub_fact = 1; oversub_fact 373 ompi/mca/topo/treematch/treematch/tm_topology.c res->oversub_fact = 1; //defaut oversub_fact 446 ompi/mca/topo/treematch/treematch/tm_topology.c for(id = 0; id < topology->nb_nodes[topology->nb_levels-1]/topology->oversub_fact; id++) oversub_fact 459 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_levels, topology->nb_constraints, topology->oversub_fact, topology->nb_proc_units); oversub_fact 724 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo->oversub_fact = (*topology)->oversub_fact; oversub_fact 774 ompi/mca/topo/treematch/treematch/tm_topology.c topology->oversub_fact = 1; oversub_fact 850 ompi/mca/topo/treematch/treematch/tm_topology.c void tm_enable_oversubscribing(tm_topology_t *topology, unsigned int oversub_fact){ oversub_fact 855 ompi/mca/topo/treematch/treematch/tm_topology.c if(oversub_fact <=1) oversub_fact 862 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> oversub_fact = oversub_fact; oversub_fact 865 ompi/mca/topo/treematch/treematch/tm_topology.c n = topology->nb_nodes[i-1] * oversub_fact; oversub_fact 866 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity[i-1] = oversub_fact; oversub_fact 873 ompi/mca/topo/treematch/treematch/tm_topology.c int id = topology->node_id[j/oversub_fact]; oversub_fact 2240 ompi/mca/topo/treematch/treematch/tm_tree.c int nb_constraints = topology->nb_constraints*topology->oversub_fact; oversub_fact 2251 ompi/mca/topo/treematch/treematch/tm_tree.c shift = 1 + i%topology->oversub_fact - topology->oversub_fact; oversub_fact 2252 ompi/mca/topo/treematch/treematch/tm_tree.c (*constraints)[i] = topology->node_rank[topology->constraints[i/topology->oversub_fact]] +shift; oversub_fact 2277 ompi/mca/topo/treematch/treematch/tm_tree.c int npu, nb_processes, oversub_fact, nb_slots; oversub_fact 2281 ompi/mca/topo/treematch/treematch/tm_tree.c oversub_fact = topology->oversub_fact; oversub_fact 2286 ompi/mca/topo/treematch/treematch/tm_tree.c nb_slots = npu * oversub_fact; oversub_fact 2294 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Oversubscrbing factor: %d\n", oversub_fact); oversub_fact 72 ompi/mca/topo/treematch/treematch/treematch.h int oversub_fact; /* Maximum number of processes to be mapped on a given node */ oversub_fact 102 ompi/mca/topo/treematch/treematch/treematch.h int oversub_fact; oversub_fact 164 ompi/mca/topo/treematch/treematch/treematch.h void tm_enable_oversubscribing(tm_topology_t *topology, unsigned int oversub_fact);