Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
M. G. Furugyan · Moscow University Computational Mathematics and Cybernetics · 2017
The problem of feasible preemptive scheduling in a multiprocessor system is considered for when scheduled intervals are assigned, processor performance can be arbitrary, there are several types of additional resources, and the time for executing tasks depends linearly on the amount of additional resources allocated to them. Polynomial algorithms based on reducing the original problem to a flow problem and a linear programming problem are developed.