• Shanoo Aggarwal
• Anil rao

Cloud computing (CC) is fast-growing and frequently adopted in information technology (IT) environments due to the benefits it offers. Task scheduling and load balancing are amongst the hot topics in the realm of CC. To overcome the shortcomings of the existing task scheduling and load balancing approaches, we propose a novel approach that uses k means clustering and DSJF algorithm for task scheduling. In this paper, load balancing algorithm based on honey bee behaviour (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. Many scheduling algorithms have been proposed to schedule the tasks in cloud computing environment such as (SJF) and (FCFS) algorithms. This paper aims to improve the shortest job first scheduling algorithm in the cloud computing. In tasks scheduling (TS), the most important parameters are makes pan and response time. The proposed task scheduling technique is compared with the existing Heterogeneous Shortest Job First (DSJF) technique in terms of a) Make span time, b) Processing Time, c) Processing Cost, d) Execution Time.

A Novel Task Scheduling DSJF algorithm with K means clustering and Honey Bee Load Balancing Technique in Cloud Computing

"A Novel Task Scheduling DSJF algorithm with K means clustering and Honey Bee Load Balancing Technique in Cloud Computing", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.7, Issue 7, page no.2090-2098, July-2020, Available :http://www.jetir.org/papers/JETIR2007266.pdf

"A Novel Task Scheduling DSJF algorithm with K means clustering and Honey Bee Load Balancing Technique in Cloud Computing", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 7, page no. pp2090-2098, July-2020, Available at : http://www.jetir.org/papers/JETIR2007266.pdf