Lower-bound complexity algorithm for task scheduling on heterogeneous grid

DOI10.1007/S00607-017-0558-5MaRDI QIDQ1700990zbMATH OpenOpenAlexFDO

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

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

grid computingtask schedulingheterogeneous grids

Mathematics Subject Classification ID

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

Recommendations

• A heuristic algorithm for scheduling multiprocessor tasks in a grid computing environment
• A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing
• scientific article; zbMATH DE number 1954164
• scientific article; zbMATH DE number 2089185
• A grid DAG scheduling algorithm based on fuzzy clustering

Cites work

• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A machine assignment mechanism for compile-time list-scheduling heuristics
• Grids and Grid technologies for wide-area distributed computing
• List scheduling with duplication for heterogeneous computing systems
• NP-complete scheduling problems
• Scheduling. Theory, algorithms, and systems.

Describes a project that uses

Uses Software

• DAGMap

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1700990)