TY - GEN
T1 - An Efficient Workflow Scheduling Algorithm in Cloud Computing Using Cuckoo Search and PSO Algorithms
AU - Mangalampalli, Sudheer
AU - Pokkuluri, Kiran Sree
AU - Kocherla, Raviteja
AU - Rapaka, Anuj
AU - Kota, Narayana Rao
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2022
Y1 - 2022
N2 - Recent developments in cloud computing are a great advantage to the IT enterprises as most of the IT infrastructure used by IT companies are managed by cloud vendors. This led to the situation all the services, i.e., compute, storage and network were given to the users as services with the cloud paradigm. Many of the users around the globe access the cloud for different kind of applications and to provision the resources to users in a seamless fashion with variable requests in terms of size and variety is a huge challenge in cloud computing. It all depends on how the workflows can be assigned to the appropriate resources for a specified amount of time. Scheduling workflows is a great challenge in cloud computing as each of a task in a workflow depends on another task. An appropriate scheduler is necessary to effectively map these variable tasks onto VMs by minimizing makespan and energy consumption as these are the important parameters in the view of cloud vendors. In this paper, we are scheduling tasks, which are in the workflow to a suitable VM by considering task priority. This algorithm is modeled by combining both PSO and CS algorithms. It is simulated by using cloudsim simulator, it is evaluated against the existing algorithms PSO and CS algorithms, and our proposed approach is outperformed over existing algorithms in terms of makespan and energy consumption.
AB - Recent developments in cloud computing are a great advantage to the IT enterprises as most of the IT infrastructure used by IT companies are managed by cloud vendors. This led to the situation all the services, i.e., compute, storage and network were given to the users as services with the cloud paradigm. Many of the users around the globe access the cloud for different kind of applications and to provision the resources to users in a seamless fashion with variable requests in terms of size and variety is a huge challenge in cloud computing. It all depends on how the workflows can be assigned to the appropriate resources for a specified amount of time. Scheduling workflows is a great challenge in cloud computing as each of a task in a workflow depends on another task. An appropriate scheduler is necessary to effectively map these variable tasks onto VMs by minimizing makespan and energy consumption as these are the important parameters in the view of cloud vendors. In this paper, we are scheduling tasks, which are in the workflow to a suitable VM by considering task priority. This algorithm is modeled by combining both PSO and CS algorithms. It is simulated by using cloudsim simulator, it is evaluated against the existing algorithms PSO and CS algorithms, and our proposed approach is outperformed over existing algorithms in terms of makespan and energy consumption.
UR - https://www.scopus.com/pages/publications/85127689523
UR - https://www.scopus.com/pages/publications/85127689523#tab=citedBy
U2 - 10.1007/978-981-16-8987-1_15
DO - 10.1007/978-981-16-8987-1_15
M3 - Conference contribution
AN - SCOPUS:85127689523
SN - 9789811689864
T3 - Lecture Notes in Networks and Systems
SP - 137
EP - 145
BT - Innovations in Computer Science and Engineering - Proceedings of the 9th ICICSE, 2021
A2 - Saini, H. S.
A2 - Sayal, Rishi
A2 - Govardhan, A.
A2 - Buyya, Rajkumar
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th International Conference on Innovations in Computer Science and Engineering, ICICSE 2021
Y2 - 3 September 2021 through 4 September 2021
ER -
