Algorithm addresses job scheduling in multiprocessor systems, optimizing resource distribution to ensure task completion.
The problem of job scheduling in a multiprocessor real-time computing system (MRTCS) is solved for the case when requests for task execution are received cyclically with specified periods. In addition to processors, there are also nonrenewable resources. The volumes of job execution are assumed to be fixed. An algorithm for the optimal distribution of nonrenewable resources and construction of an admissible schedule is developed. The algorithm is based on reducing the original problem to finding a flow in a special type of network. In the case where a solution does not exist, it is shown how the periods of receipt of requests should be increased so that a solution exists. The issue of the stability of solutions is also investigated.
No takes yet. Share an insight, caveat, or question.
M. G. Furugyan (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: