Charm++: Charm Source Code Documentation

00001 #ifndef TM_MAPPING_H
00002 #define TM_MAPPING_H
00003 
00004 #ifdef __cplusplus
00005 extern "C" {
00006 #endif
00007 
00008 #include "tm_tree.h"
00009 int  build_comm(char *filename,double ***pcomm);
00010 void TreeMatchMapping(int nb_obj, int nb_proc,double **comm_mat,  double * obj_weigth, double *com_speed, int d, int *sol);
00011 double print_sol(int N,int *Value,double **comm, double **arch);
00012 
00013 /*Map topology to cores: 
00014  sigma_i is such that  process i is mapped on core sigma_i
00015  k_i is such that core i exectutes process k_i
00016 
00017  size of sigma is the number of process (nb_objs)
00018  size of k is the number of cores/nodes (nb_proc)
00019 
00020  We must have numbe of process<=number of cores
00021 
00022  k_i =-1 if no process is mapped on core i
00023 */
00024 void map_topology_simple(tm_topology_t *topology,tree_t *comm_tree, int *sigma,int *k);
00025 
00026 int nb_nodes(tm_topology_t *topology);
00027 void free_topology(tm_topology_t *topology);
00028 void display_other_heuristics(tm_topology_t *topology,int N,double **comm,double **arch);
00029 void print_1D_tab(int *tab,int N);
00030 void   build_synthetic_proc_id(tm_topology_t *topology);
00031 void display_topology(tm_topology_t *topology);
00032 tm_topology_t  *build_synthetic_topology(int *arity, int nb_levels, int *core_numbering, int nb_core_per_node);
00033 
00034 
00035 #ifdef __cplusplus
00036 }
00037 #endif
00038 
00039 #endif
ck-ldb/tm_mapping.h
