Lower-bound complexity algorithm for task scheduling on heterogeneous grid

DOI10.1007/S00607-017-0558-5zbMath1382.68041OpenAlexW2619602653MaRDI QIDQ1700990

Yousef B. Mahdy, Tarek Hagras, Jan Janeček, Asmaa Atef

Publication date: 22 February 2018

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-017-0558-5

zbMATH Keywords

task schedulinggrid computingheterogeneous grids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• DAGMap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List scheduling with duplication for heterogeneous computing systems
• NP-complete scheduling problems
• Grids and Grid technologies for wide-area distributed computing
• Scheduling

This page was built for publication: Lower-bound complexity algorithm for task scheduling on heterogeneous grid