Email this article Making schedules in multiprocessing systems with several additional resources
- Authors: Furugyan M.G.1
-
Affiliations:
- Federal Research Center Information Science and Control
- Issue: Vol 56, No 2 (2017)
- Pages: 227-235
- Section: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/219838
- DOI: https://doi.org/10.1134/S1064230717020071
- ID: 219838
Cite item
Open Access
Access granted
Subscription Access
Abstract
The problem of making a feasible schedule in a preemptive multiprocessing system with identical processors and several types of additional recourses is considered in the case when the task execution intervals are given and the durations of task execution linearly depend on the amount of the additional resource allocated to them. Algorithms based on reducing this problem to a network flow problem and a system of linear constraints are developed.
About the authors
M. G. Furugyan
Federal Research Center Information Science and Control
Author for correspondence.
Email: rtsccas@ya.ru
Russian Federation, Moscow
