On-line algorithm for scheduling parallel tasks on related computational clusters with processors of different capacities and it’s average-case analysis

In this article the on-line problem of scheduling parallel tasks on related computational clusters with processors of different capacities was studied in average case. In the problem the objective is to make a schedule on k clusters with w processors each of N tasks, where the task i,i≤N requires ti...

Full description

Saved in:
Bibliographic Details
Published in:Trudy Instituta sistemnogo programmirovaniâ Vol. 30; no. 6; pp. 105 - 122
Main Authors: Lazarev, D.O., Kuzyurin, N.N.
Format: Journal Article
Language:English
Published: Russian Academy of Sciences, Ivannikov Institute for System Programming 01.02.2019
Subjects:
ISSN:2079-8156, 2220-6426
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first