Enviar artigo por via de e-mail Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Autores: Furugyan M.G.1,2
-
Afiliações:
- Faculty of Computational Mathematics and Cybernetics
- Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”
- Edição: Volume 41, Nº 3 (2017)
- Páginas: 145-151
- Seção: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176197
- DOI: https://doi.org/10.3103/S0278641917030049
- ID: 176197
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Palavras-chave
Sobre autores
M. Furugyan
Faculty of Computational Mathematics and Cybernetics; Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”
Autor responsável pela correspondência
Email: rtsccas@ya.ru
Rússia, Moscow, 119991; Moscow, 119333
Arquivos suplementares
