Article thumbnail

Workflow Scheduling Algorithms for Hard-deadline Constrained Cloud Environments

By Alexander A. Visheratin, Mikhail Melnik and Denis Nasonov


AbstractCloud computational platforms today are very promising for execution of scientific applications since they provide ready to go infrastructure for almost any task. However, complex tasks, which contain a large number of interconnected applications, which are usually called workflows, require efficient tasks scheduling in order to satisfy user defined QoS, like cost or execution time (makespan). When QoS has some restrictions – limited cost or deadline – scheduling becomes even more complicated. In this paper we propose heuristic algorithm for scheduling workflows in hard-deadline constrained clouds – Levelwise Deadline Distributed Linewise Scheduling (LDD-LS) – which, in combination with implementation of IC-PCP algorithm, is used for initialization of proposed metaheuristic algorithm – Cloud Deadline Coevolutional Genetic Algorithm (CDCGA). Experiments show high efficiency of CDCGA, which makes it potentially applicable for scheduling in cloud environments

Publisher: The Author(s). Published by Elsevier B.V.
Year: 2016
DOI identifier: 10.1016/j.procs.2016.05.529
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • https://s3-eu-west-1.amazonaws... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.