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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computing Ročník 99; číslo 11; s. 1125 - 1145
Hlavní autori:	Atef, Asmaa, Hagras, Tarek, Mahdy, Yousef B., Janeček, Jan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Vienna Springer Vienna 01.11.2017 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!