A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Journal of Software
QoS constraint based workflow scheduling described by Directed Acyclic Graph (DAG) has been proved to be a NP-hard problem in Cloud Computing Services, especially for cost minimization under deadline constraint. Due to Deadline Bottom Level (DBL) hasn't considered the concurrence during the real executing process that cause much more shatter time to solve such problem, this paper proposes a novel heuristics approach of Concurrent Level based Workflow Scheduling (CLWS). It stratifies all thedoi:10.4304/jsw.9.4.926-930 fatcat:semmdxukcfcl3cc7s6kumdckom