Email this article Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Authors: Furugyan M.G.1,2
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”
- Issue: Vol 41, No 3 (2017)
- Pages: 145-151
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176197
- DOI: https://doi.org/10.3103/S0278641917030049
- ID: 176197
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
M. G. Furugyan
Faculty of Computational Mathematics and Cybernetics; Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”
Author for correspondence.
Email: rtsccas@ya.ru
Russian Federation, Moscow, 119991; Moscow, 119333
Supplementary files
