MINIMIZING THE NUMBER OF PROCESSING UNITS IN DISTRIBUTED COMPUTATIONS

MINIMIZING THE NUMBER OF PROCESSING UNITS IN DISTRIBUTED COMPUTATIONS

Polynomial algorithms for finding the minimum number of processing units in the problem of scheduling heterogeneous competing processes on parallel processors are developed. The algorithms ensure minimum completion time of all the processes and their completion by the specified deadline.

Saved in:
Bibliographic Details
Main Authors: N. S. Kovalenko, V. N. Vengherov, V. M. Metelyskij
Format: Article
Language:Russian
Published: National Academy of Sciences of Belarus, the United Institute of Informatics Problems 2016-09-01
Series:Informatika
Online Access:https://inf.grid.by/jour/article/view/29
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items