Мақаланы E-mail арқылы жіберу Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Авторлар: Furugyan M.G.1,2
-
Мекемелер:
- Faculty of Computational Mathematics and Cybernetics
- Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”
- Шығарылым: Том 41, № 3 (2017)
- Беттер: 145-151
- Бөлім: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176197
- DOI: https://doi.org/10.3103/S0278641917030049
- ID: 176197
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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.
Негізгі сөздер
Авторлар туралы
M. Furugyan
Faculty of Computational Mathematics and Cybernetics; Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”
Хат алмасуға жауапты Автор.
Email: rtsccas@ya.ru
Ресей, Moscow, 119991; Moscow, 119333
Қосымша файлдар
