StarPU Handbook
sc_hypervisor_lp.h
Go to the documentation of this file.
1 /* StarPU --- Runtime system for heterogeneous multicore architectures.
2  *
3  * Copyright (C) 2010-2014 Inria
4  * Copyright (C) 2012-2013,2015,2017 CNRS
5  *
6  * StarPU is free software; you can redistribute it and/or modify
7  * it under the terms of the GNU Lesser General Public License as published by
8  * the Free Software Foundation; either version 2.1 of the License, or (at
9  * your option) any later version.
10  *
11  * StarPU is distributed in the hope that it will be useful, but
12  * WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
14  *
15  * See the GNU Lesser General Public License in COPYING.LGPL for more details.
16  */
17 
18 #ifndef SC_HYPERVISOR_LP_H
19 #define SC_HYPERVISOR_LP_H
20 
21 #include <sc_hypervisor.h>
22 #include <starpu_config.h>
23 
24 #ifdef __cplusplus
25 extern "C"
26 {
27 #endif
28 
29 /*
30  * GNU Linear Programming Kit backend
31  */
32 #ifdef STARPU_HAVE_GLPK_H
33 #include <glpk.h>
34 #endif //STARPU_HAVE_GLPK_H
35 
37 struct types_of_workers;
38 /* returns tmax, and computes in table res the nr of workers needed by each context st the system ends up in the smallest tmax*/
39 double sc_hypervisor_lp_get_nworkers_per_ctx(int nsched_ctxs, int ntypes_of_workers, double res[nsched_ctxs][ntypes_of_workers],
40  int total_nw[ntypes_of_workers], struct types_of_workers *tw, unsigned *in_sched_ctxs);
41 
42 /* returns tmax of the system */
43 double sc_hypervisor_lp_get_tmax(int nw, int *workers);
44 
45 /* the linear programme determins a rational number of ressources for each ctx, we round them depending on the type of ressource */
46 void sc_hypervisor_lp_round_double_to_int(int ns, int nw, double res[ns][nw], int res_rounded[ns][nw]);
47 
48 /* redistribute the ressource in contexts by assigning the first x available ressources to each one */
49 void sc_hypervisor_lp_redistribute_resources_in_ctxs(int ns, int nw, int res_rounded[ns][nw], double res[ns][nw], unsigned *sched_ctxs, struct types_of_workers *tw);
50 
51 /* make the first distribution of ressource in contexts by assigning the first x available ressources to each one */
52 void sc_hypervisor_lp_distribute_resources_in_ctxs(unsigned* sched_ctxs, int ns, int nw, int res_rounded[ns][nw], double res[ns][nw], int *workers, int nworkers, struct types_of_workers *tw);
53 
54 /* make the first distribution of ressource in contexts by assigning the first x available ressources to each one, share not integer no of workers */
55 void sc_hypervisor_lp_distribute_floating_no_resources_in_ctxs(unsigned* sched_ctxs, int ns, int nw, double res[ns][nw], int *workers, int nworkers, struct types_of_workers *tw);
56 
57 /* place resources in contexts dependig on whether they already have workers or not */
58 void sc_hypervisor_lp_place_resources_in_ctx(int ns, int nw, double w_in_s[ns][nw], unsigned *sched_ctxs, int *workers, unsigned do_size, struct types_of_workers *tw);
59 
60 /* not used resources are shared between all contexts */
61 void sc_hypervisor_lp_share_remaining_resources(int ns, unsigned *sched_ctxs, int nworkers, int *workers);
62 
63 /* dichotomy btw t1 & t2 */
64 double sc_hypervisor_lp_find_tmax(double t1, double t2);
65 
66 /* execute the lp trough dichotomy */
67 unsigned sc_hypervisor_lp_execute_dichotomy(int ns, int nw, double w_in_s[ns][nw], unsigned solve_lp_integer, void *specific_data,
68  double tmin, double tmax, double smallest_tmax,
69  double (*lp_estimated_distrib_func)(int ns, int nw, double draft_w_in_s[ns][nw],
70  unsigned is_integer, double tmax, void *specifc_data));
71 
72 #ifdef STARPU_HAVE_GLPK_H
73 /* linear program that returns 1/tmax, and computes in table res the nr of workers needed by each context st
74  the system ends up in the smallest tmax*/
75 double sc_hypervisor_lp_simulate_distrib_flops(int nsched_ctxs, int ntypes_of_workers, double speed[nsched_ctxs][ntypes_of_workers],
76  double flops[nsched_ctxs], double res[nsched_ctxs][ntypes_of_workers], int total_nw[ntypes_of_workers],
77  unsigned sched_ctxs[nsched_ctxs], double vmax);
78 
79 /* linear program that simulates a distribution of tasks that minimises the execution time of the tasks in the pool */
80 double sc_hypervisor_lp_simulate_distrib_tasks(int ns, int nw, int nt, double w_in_s[ns][nw], double tasks[nw][nt],
81  double times[nw][nt], unsigned is_integer, double tmax, unsigned *in_sched_ctxs,
82  struct sc_hypervisor_policy_task_pool *tmp_task_pools);
83 
84 /* linear program that simulates a distribution of flops over the workers on particular sample of the execution
85  of the application such that the entire sample would finish in a minimum amount of time */
86 double sc_hypervisor_lp_simulate_distrib_flops_on_sample(int ns, int nw, double final_w_in_s[ns][nw], unsigned is_integer, double tmax,
87  double **speed, double flops[ns], double **final_flops_on_w);
88 #endif // STARPU_HAVE_GLPK_H
89 
90 #ifdef __cplusplus
91 }
92 #endif
93 
94 #endif
Definition: sc_hypervisor_policy.h:43
Definition: sc_hypervisor_policy.h:36