Abstract

In cloud computing, clients comply a policy of pay-as-you go, i.e., they only pay for the resources they use. So, the processing power of the clouds has to be optimised to reduce the cost at client's side. Using the resources optimally ensures enterprise sustainability of cloud service providers. Workflow is a set of tasks that are interdependent on each other. Scheduling these workflows is one of the most important challenges to optimally utilise the cloud resources and ensure better quality of service (QoS) to clients. Existing works on scheduling in cloud computing mainly focus on scheduling independent tasks rather than (inter)dependent tasks. In this paper, we propose a strategy to schedule dependent tasks called pre-emptive fair scheduling algorithm (PFSA). This is fair scheduling strategy also aims to ensure higher utilisation of virtual machines (VMs) by reducing the idle time and to minimise the number of times a pre-empted task is submitted to the virtual machine. In both cases, this algorithm tries to effectively reduce the overall processing time of dependent tasks at virtual machine, thus minimising the cost involved in processing of tasks. This economically viable decision-based strategy will be helpful for cloud service providers in ensuring sustainability.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.