Hour minimization based resource allocation for deadline constrained scientific workflow application in cloud computing
S. K. Jeya Brindha, J. Angela Jennifa Sujana, T. Revathi · 2016
Nowadays, the demands for Workflow applications are blooming increasingly to address the resources and VM instance hour minimization issues. Some provoking constraints acting as a breakthrough has steered us towards investigating the secret's of cloud dominance such as (1) to achieve end-to-end deadlines; (2) Minimized VM instance allotment to a particular application; (3) Minimizing the application's makespan by establishing application performance schedule; (4) Determining a VM process schedule. Initially, it is necessary to determine the lower and upper bounds for end-to-end deadliness. In response to that, we develop a heuristic Slack-Distance Minimization (SDM) algorithm for ensuring the first two conditions. After determining the application performance schedule and appropriate VM instances, it is necessary to minimize the instance hours by using our proposed Resource Hour Minimization (RHM) algorithm. The investigational outcome proves that the proposed SDM algorithm is an outstanding one when compared to other algorithms like HEFT and MOHEFT. Furthermore, the comparisons were made in the presence and absence of the RHM algorithm for ensuring the minimized execution instance hours.