Date Added: Jan 2010
The problem of scheduling a set of tasks on a multiprocessor architecture is addressed. Tasks are assumed to be sporadic with arbitrary deadlines and may migrate between processors. The execution of migrating tasks is controlled by a bandwidth reservation scheme so that schedulability is guaranteed by EDF. Task migration costs are taken into consideration. Results from experiments indicate that the proposed approach performs well in terms of schedulability. Nowadays multiprocessor architectures have become commonplace in the market. Machines equipped with chips with up to eight cores can be found in low-budget desktops and this trend will seem to continue for some time.