Planning computations in a multiprocessor system with unfixed parameters

Resumo

The problem of constructing a feasible preemptive multiprocessor schedule is considered for a case where directive intervals are assigned, processors can have arbitrary performance, and the amount of tasks depends linearly on the volume of additional resources allocated for them. In cases where a feasible schedule is not found with an allocated volume of additional resources, the problem of optimally correcting the directive intervals is considered. The solution is based on an analysis of the necessary and sufficient conditions of a feasible schedule’s existence.