You can view the full text of this article for free using the link below.

Title: De-centralised dynamic task scheduling using hill climbing algorithm in cloud computing environments

Authors: Mona Mohammadi; Amir Masoud Rahmani

Addresses: Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran ' Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

Abstract: There are many tasks in cloud computing that should be executed by available resources to acquire high performance, reduce task completion time, increase utilisation of resources etc. Since task scheduling problem in cloud computing is an NP-hard problem, designing an efficient scheduling strategy to achieve the intentions listed above is challenging. Task scheduling is the process of allocating tasks to available resources such that performance metrics are improved. This paper proposes a dynamic scheduling algorithm that uses hill climbing algorithm. It tries to minimise completion time of tasks while maximising throughput and utilisation of resources. This algorithm allocates independent tasks to available resources to achieve load balance. The simulation results show that the algorithm can achieve load balance and reduces completion time of tasks.

Keywords: cloud computing; task scheduling; dynamic scheduling algorithm; hill climbing algorithm; load balancing.

DOI: 10.1504/IJCC.2017.083914

International Journal of Cloud Computing, 2017 Vol.6 No.1, pp.79 - 94

Available online: 26 Apr 2017

Full-text access for editors Access for subscribers Free access Comment on this article