Abstract
We consider the problem of composing an admissible schedule with interruptions for a multiprocessor real time ACS in case when directive intervals are given, processors may have arbitrary performances, and the durations of jobs depend linearly on the amount of additional resource assigned to them. We develop algorithms based on a reduction of the original problem to a minimal cost flow problem and to a linear programming problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Tanaev, V.S., Gordon, V.S., and Shafranskii, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-Stage Systems), Moscow: Nauka, 1984.
Federgruen, A. and Groenevel, H., Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Technique, Manage. Sci., 1986, vol. 32, no. 3, pp. 341–349.
Gonzales, T. and Sahni, S., Preemptive Scheduling of Uniform Processor Systems, J. Associat. Comput. Machin., 1978, vol. 25, no. 1, pp. 92–101.
Davydov, E.G., Issledovanie operatsii (Operations Research), Moscow: Vysshaya Shkola, 1990.
Kosorukov, E.O. and Furugyan, M.G., Resource Distribution Algorithms in Multiprocessor Systems, Vestn. Mosk. Gos. Univ., 2009, Ser. 15, no. 4, pp. 34–37.
Fillipps, D. and Garcia-Diaz, A., Fundamentals of Network Analysis, Englewood Cliffs: Prentice-Hall, 1981. Translated under the title Metody analiza setei, Moscow: Mir, 1984.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M.G. Furugyan, 2015, published in Avtomatika i Telemekhanika, 2015, No. 3, pp. 144–150.
Rights and permissions
About this article
Cite this article
Furugyan, M.G. Computation planning in multiprocessor real time automated control systems with an additional resource. Autom Remote Control 76, 487–492 (2015). https://doi.org/10.1134/S0005117915030121
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117915030121