123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475 |
- /* StarPU --- Runtime system for heterogeneous multicore architectures.
- *
- * Copyright (C) 2008-2020 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
- * Copyright (C) 2016 Uppsala University
- *
- * StarPU is free software; you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation; either version 2.1 of the License, or (at
- * your option) any later version.
- *
- * StarPU is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
- *
- * See the GNU Lesser General Public License in COPYING.LGPL for more details.
- */
- /* FIFO queues, ready for use by schedulers */
- #ifndef __FIFO_QUEUES_H__
- #define __FIFO_QUEUES_H__
- /** @file */
- #include <starpu.h>
- #include <core/task.h>
- struct _starpu_fifo_taskq
- {
- /** the actual list */
- struct starpu_task_list taskq;
- /** the number of tasks currently in the queue */
- unsigned ntasks;
- /** the number of tasks currently in the queue corresponding to each priority */
- unsigned *ntasks_per_priority;
- /** the number of tasks that were processed */
- unsigned nprocessed;
- /** only meaningful if the queue is only used by a single worker */
- double exp_start; /** Expected start date of next item to do in the
- * queue (i.e. not started yet). This is thus updated
- * when we start it. */
- double exp_end; /** Expected end date of last task in the queue */
- double exp_len; /** Expected duration of the set of tasks in the queue */
- double *exp_len_per_priority; /** Expected duration of the set of tasks in the queue corresponding to each priority */
- double pipeline_len; /** the expected duration of what is already pushed to the worker */
- };
- struct _starpu_fifo_taskq*_starpu_create_fifo(void) STARPU_ATTRIBUTE_MALLOC;
- void _starpu_init_fifo(struct _starpu_fifo_taskq *fifo);
- void _starpu_destroy_fifo(struct _starpu_fifo_taskq *fifo);
- int _starpu_fifo_empty(struct _starpu_fifo_taskq *fifo);
- double _starpu_fifo_get_exp_len_prev_task_list(struct _starpu_fifo_taskq *fifo_queue, struct starpu_task *task,
- int workerid, int nimpl, int *fifo_ntasks);
- int _starpu_fifo_push_sorted_task(struct _starpu_fifo_taskq *fifo_queue, struct starpu_task *task);
- int _starpu_fifo_push_task(struct _starpu_fifo_taskq *fifo, struct starpu_task *task);
- int _starpu_fifo_push_back_task(struct _starpu_fifo_taskq *fifo_queue, struct starpu_task *task);
- int _starpu_fifo_pop_this_task(struct _starpu_fifo_taskq *fifo_queue, int workerid, struct starpu_task *task);
- struct starpu_task *_starpu_fifo_pop_task(struct _starpu_fifo_taskq *fifo, int workerid);
- struct starpu_task *_starpu_fifo_pop_local_task(struct _starpu_fifo_taskq *fifo);
- struct starpu_task *_starpu_fifo_pop_every_task(struct _starpu_fifo_taskq *fifo, int workerid);
- int _starpu_normalize_prio(int priority, int num_priorities, unsigned sched_ctx_id);
- int _starpu_count_non_ready_buffers(struct starpu_task *task, unsigned worker);
- struct starpu_task *_starpu_fifo_pop_first_ready_task(struct _starpu_fifo_taskq *fifo_queue, unsigned workerid, int num_priorities);
- #endif // __FIFO_QUEUES_H__
|