123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248 |
- #ifndef __SCHED_NODE_H__
- #define __SCHED_NODE_H__
- #include <starpu.h>
- #include <common/starpu_spinlock.h>
- #ifdef STARPU_HAVE_HWLOC
- #include <hwloc.h>
- #endif
- /* struct starpu_sched_node are scheduler modules, a scheduler is a tree-like
- * structure of them, some parts of scheduler can be shared by several contexes
- * to perform some local optimisations, so, for all nodes, a list of father is
- * defined indexed by sched_ctx_id
- *
- * they embed there specialised method in a pseudo object-style, so calls are like node->push_task(node,task)
- *
- */
- struct starpu_sched_node
- {
- /* node->push_task(node, task)
- * this function is called to push a task on node subtree, this can either
- * perform a recursive call on a child or store the task in the node, then
- * it will be returned by a further pop_task call
- *
- * the caller must ensure that node is able to execute task
- */
- int (*push_task)(struct starpu_sched_node *,
- struct starpu_task *);
- /* this function is called by workers to get a task on them fathers
- * this function should first return a localy stored task or perform
- * a recursive call on father
- *
- * a default implementation simply do a recursive call on father
- */
- struct starpu_task * (*pop_task)(struct starpu_sched_node *,
- unsigned sched_ctx_id);
- /* this function notify underlying worker that a task as been pushed
- * and would be returned by a pop_task call
- * it should be called each time a node localy store a task
- * default implementation simply perform a recursive call on childrens
- * this function can be called by a worker as it doesn't try to wake up himself
- */
- void (*available)(struct starpu_sched_node *);
- /* this function is an heuristic that compute load of subtree, basicaly
- * it compute
- * estimated_load(node) = sum(estimated_load(node_childs)) +
- * nb_local_tasks / average(relative_speedup(underlying_worker))
- */
- double (*estimated_load)(struct starpu_sched_node * node);
- double (*estimated_end)(struct starpu_sched_node * node);
- /* the numbers of node's childs
- */
- int nchilds;
- /* the vector of node's childs
- */
- struct starpu_sched_node ** childs;
- /* may be shared by several contexts
- * so we need several fathers
- */
- struct starpu_sched_node * fathers[STARPU_NMAX_SCHED_CTXS];
- /* the set of workers in the node's subtree
- */
- struct starpu_bitmap * workers;
- /* the workers available in context
- */
- struct starpu_bitmap * workers_in_ctx;
-
- /* is_homogeneous is 0 iff workers in the node's subtree are heterogeneous,
- * this field is set and updated automaticaly, you shouldn't write on it
- */
- int is_homogeneous;
- /* node's private data, no restriction on use
- */
- void * data;
- /* this function is called after all childs has been set, and the
- * workers member was filled, can be used to init data, or anything you want
- */
- void (*init_data)(struct starpu_sched_node *);
- /* this function is called to free data allocated by init_data
- * just before the call of starpu_sched_node_destroy(node)
- */
- void (*deinit_data)(struct starpu_sched_node *);
- #ifdef STARPU_HAVE_HWLOC
- /* in case of a hierarchical scheduler, this is set to the part of
- * topology that is binded to this node, eg: a numa node for a ws
- * node that would balance load between underlying sockets
- */
- hwloc_obj_t obj;
- #endif
- };
- struct starpu_sched_tree
- {
- struct starpu_sched_node * root;
- struct starpu_bitmap * workers;
- /* this lock is used to protect the scheduler,
- * it is taken in read mode pushing a task
- * and in write mode for adding or removing workers
- */
- starpu_pthread_rwlock_t lock;
- };
- int STARPU_WARN_UNUSED_RESULT starpu_sched_node_execute_preds(struct starpu_sched_node * node, struct starpu_task * task, double * length);
- double starpu_sched_node_transfer_length(struct starpu_sched_node * node, struct starpu_task * task);
- struct starpu_sched_node * starpu_sched_node_create(void);
- void starpu_sched_node_destroy(struct starpu_sched_node * node);
- void starpu_sched_node_set_father(struct starpu_sched_node *node, struct starpu_sched_node *father_node, unsigned sched_ctx_id);
- void starpu_sched_node_add_child(struct starpu_sched_node * node, struct starpu_sched_node * child);
- void starpu_sched_node_remove_child(struct starpu_sched_node * node, struct starpu_sched_node * child);
- int starpu_sched_node_can_execute_task(struct starpu_sched_node * node, struct starpu_task * task);
- /* no public create function for workers because we dont want to have several node_worker for a single workerid */
- struct starpu_sched_node * starpu_sched_node_worker_get(int workerid);
- /* this function compare the available function of the node with the standard available for worker nodes*/
- int starpu_sched_node_is_worker(struct starpu_sched_node * node);
- int starpu_sched_node_is_simple_worker(struct starpu_sched_node * node);
- int starpu_sched_node_is_combined_worker(struct starpu_sched_node * node);
- int starpu_sched_node_worker_get_workerid(struct starpu_sched_node * worker_node);
- struct starpu_sched_node * starpu_sched_node_fifo_create(void * arg STARPU_ATTRIBUTE_UNUSED);
- int starpu_sched_node_is_fifo(struct starpu_sched_node * node);
- //struct starpu_task_list starpu_sched_node_fifo_get_non_executable_tasks(struct starpu_sched_node * fifo_node);
- struct starpu_sched_node * starpu_sched_node_work_stealing_create(void);
- int starpu_sched_node_is_work_stealing(struct starpu_sched_node * node);
- struct starpu_sched_node * starpu_sched_node_random_create(void * arg STARPU_ATTRIBUTE_UNUSED);
- int starpu_sched_node_is_random(struct starpu_sched_node *);
- struct starpu_heft_data
- {
- double alpha;
- double beta;
- double gamma;
- double idle_power;
- struct starpu_sched_node * (*no_perf_model_node_create)(void * arg_no_perf_model);
- void * arg_no_perf_model;
- struct starpu_sched_node * (*calibrating_node_create)(void * arg_calibrating_node);
- void * arg_calibrating_node;
- };
- /* create a node with heft_data paremeters
- a copy the struct starpu_heft_data * given is performed during the init_data call
- the heft node doesnt do anything but pushing tasks on no_perf_model_node and calibrating_node
- */
- struct starpu_sched_node * starpu_sched_node_heft_create(struct starpu_heft_data * heft_data);
- int starpu_sched_node_is_heft(struct starpu_sched_node * node);
- /* compute predicted_end by taking in account the case of the predicted transfer and the predicted_end overlap
- */
- double starpu_sched_compute_expected_time(double now, double predicted_end, double predicted_length, double predicted_transfer);
- /* this node select the best implementation for the first worker in context that can execute task.
- * and fill task->predicted and task->predicted_transfer
- * cannot have several childs if push_task is called
- */
- struct starpu_sched_node * starpu_sched_node_best_implementation_create(void * arg STARPU_ATTRIBUTE_UNUSED);
- /* this node select an implementation that need to be calibrated.
- * cannot have several childs if push_task is called.
- */
- struct starpu_sched_node * starpu_sched_node_calibration_create(void * arg STARPU_ATTRIBUTE_UNUSED);
- /*create an empty tree
- */
- struct starpu_sched_tree * starpu_sched_tree_create(void);
- void starpu_sched_tree_destroy(struct starpu_sched_tree * tree, unsigned sched_ctx_id);
- /* destroy node and all his child
- * except if they are shared between several contexts
- */
- void starpu_sched_node_destroy_rec(struct starpu_sched_node * node, unsigned sched_ctx_id);
- int starpu_sched_tree_push_task(struct starpu_task * task);
- struct starpu_task * starpu_sched_tree_pop_task(unsigned sched_ctx_id);
- void starpu_sched_tree_add_workers(unsigned sched_ctx_id, int *workerids, unsigned nworkers);
- void starpu_sched_tree_remove_workers(unsigned sched_ctx_id, int *workerids, unsigned nworkers);
- void starpu_sched_node_worker_pre_exec_hook(struct starpu_task * task);
- void starpu_sched_node_worker_post_exec_hook(struct starpu_task * task);
- /* return the bitmap of worker that are allowed to use in this scheduling context
- */
- struct starpu_bitmap * _starpu_get_worker_mask(struct starpu_task * task);
- /* this function is called to initialize a scheduler tree
- */
- void starpu_sched_node_init_rec(struct starpu_sched_node * node);
- /* this function fill all the node->workers members
- */
- void _starpu_set_workers_bitmaps(void);
- /* this function call init data on all nodes in postfix order
- */
- void starpu_sched_tree_call_init_data(struct starpu_sched_tree * t);
- /* push task of list lower as possible in the tree, a non null value is returned if some task couldn't be pushed
- */
- int starpu_sched_node_push_tasks_to_firsts_suitable_parent(struct starpu_sched_node * node, struct starpu_task_list * list, int sched_ctx_id);
- struct starpu_bitmap;
- struct starpu_bitmap * starpu_bitmap_create(void);
- void starpu_bitmap_destroy(struct starpu_bitmap *);
- void starpu_bitmap_set(struct starpu_bitmap *, int);
- void starpu_bitmap_unset(struct starpu_bitmap *, int);
- void starpu_bitmap_unset_all(struct starpu_bitmap *);
- int starpu_bitmap_get(struct starpu_bitmap *, int);
- /* basicaly compute starpu_bitmap_unset_all(a) ; a = b & c; */
- void starpu_bitmap_unset_and(struct starpu_bitmap * a, struct starpu_bitmap * b, struct starpu_bitmap * c);
- /* this is basically compute a |= b;*/
- void starpu_bitmap_or(struct starpu_bitmap * a,
- struct starpu_bitmap * b);
- //return 1 iff e set in b1 AND e set in b2
- int starpu_bitmap_and_get(struct starpu_bitmap * b1,
- struct starpu_bitmap * b2,
- int e);
- int starpu_bitmap_cardinal(struct starpu_bitmap *);
- //return the index of first bit, -1 if none
- int starpu_bitmap_first(struct starpu_bitmap *);
- int starpu_bitmap_last(struct starpu_bitmap *);
- //return the index of bit right after e, -1 if none
- int starpu_bitmap_next(struct starpu_bitmap *, int e);
- #endif
|