اوف ..

The basic ideas is transform a set     of  dependent tasks into a set  of independent tasks by adequate modification of timing parameters.  Then, tasks are scheduled by the Earliest Deadline First (EDF) algorithm, iff     is schedulable.   Basically, all release times and deadlines are modified so that each task cannot start before its predecessors and cannot preempt their successors

مطلب جدید نداریم

تا اطلاع ثانوی مطلب جدیدی نداریم