* Since most scheduling algorithms rely on a concept of task
* that can be either <em>computed</em> locally or
* <em>transferred</em> on another processor, it seems to be the
* Since most scheduling algorithms rely on a concept of task
* that can be either <em>computed</em> locally or
* <em>transferred</em> on another processor, it seems to be the
* \brief set the amount data attached with a task #msg_task_t.
*
* \warning If the transfer is ongoing (already started and not finished),
* \brief set the amount data attached with a task #msg_task_t.
*
* \warning If the transfer is ongoing (already started and not finished),
* the transfer rate. A priority of 2 will make a task receive two times more
* cpu power than the other ones.
*
* the transfer rate. A priority of 2 will make a task receive two times more
* cpu power than the other ones.
*
*
* 1. Pin a given task to the first CPU core of a host.
* MSG_task_set_affinity(task, pm0, 0x01);
*
* 1. Pin a given task to the first CPU core of a host.
* MSG_task_set_affinity(task, pm0, 0x01);