Lower-bound complexity algorithm for task scheduling on heterogeneous grid

The problem of best schedule of dependent-tasks application into nodes of computational grid in low complexity is the most important issue to obtain high performance application execution. Scheduling can be performed at compile-time or at run-time depends on tasks and grid-nodes available informatio...

Full description

Saved in:

Bibliographic Details
Published in:	Computing Vol. 99; no. 11; pp. 1125 - 1145
Main Authors:	Atef, Asmaa, Hagras, Tarek, Mahdy, Yousef B., Janeček, Jan
Format:	Journal Article
Language:	English
Published:	Vienna Springer Vienna 01.11.2017 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Computer Appl. in Administrative Data Processing Computer Communication Networks Computer Science Computer simulation Heuristic Information Systems Applications (incl.Internet) Reproduction (copying) Scheduling Scheduling algorithms Software Engineering Task complexity Task scheduling Task scheduling Grid computing Heterogeneous grids 68M14
ISSN:	0010-485X, 1436-5057
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!