StarPU Handbook

- Main Page
- Related Pages
- Modules
- Data Structures
- Files

- File List
- Globals

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