Scheduling in Multiprocessor Systems with Additional Restrictions
- Authors: Furugyan M.G.1
-
Affiliations:
- Dorodnicyn Computing Center
- Issue: Vol 57, No 2 (2018)
- Pages: 222-229
- Section: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220079
- DOI: https://doi.org/10.1134/S1064230718020077
- ID: 220079
Cite item
Abstract
An admissible multiprocessor preemptive scheduling problem is solved for the given execution intervals. In addition, a number of generalizations are considered—interprocessor communications are arbitrary and may vary in time; costs for processing interruptions and switches from one processor to another are taken into account; and besides the processors, additional resources are used. Algorithms based on reducing the original problem to finding paths of a specific length in a graph, a flow problem, and an integer system of linear restrictions are developed.
About the authors
M. G. Furugyan
Dorodnicyn Computing Center
Author for correspondence.
Email: rtsccas@ya.ru
Russian Federation, Moscow, 119991