International Journal of Cloud Computing and Database Management

P-ISSN: 2707-5907, E-ISSN: 2707-5915
Printed Journal   |   Refereed Journal   |   Peer Reviewed Journal

2020, Vol. 1, Issue 2, Part A

A novel task scheduling algorithm with improved make span based on prediction of tasks computation time algorithm for cloud computing


Author(s): Maddela Kavya

Abstract: In this paper new scheduling algorithm called Prediction of Tasks Computation Time algorithm (PTCT) to estimate minimum task execution time/Makespan time for cloud computing environment. Now-a-days all cloud service providers providing all resources to end users at very cheap rate and at the same time by designing scheduling algorithms cloud service providers are ensuring that all users can get response data in quick time. Various scheduling algorithms are implemented in cloud environment such MINMIN, MAXMIN, QOS GUIDE etc. MINMIN algorithm will schedule all task with less execution time first and then schedule remaining task. In simple terms MINMIN algorithm give priority to less execution time task. MAXMIN algorithm will schedule all task with more execution time and then schedule small execution time task. In simple terms MAXMIN give priority to high execution time first. Many more scheduling algorithms are there but above two algorithms are very much popular. This two algorithms will not look for resources which can take minimum execution time and propose PTCT algorithm will look for all resources/processors/machines and then form a matrix which contains estimated execution time for all jobs and then by applying PCA (Principal Component Analysis) algorithm it will predict or choose resource which took minimum execution time and then assign new task to that selected minimum execution time resource. Here resource could be computer or processor or Virtual Machine. In propose PTCT algorithm we build an array with all task and processors as Directed Acyclic Graph (DAG) and then build a matrix with all processors and task. A matrix will contain estimated execution task time on each processor and all rows of a matrix will filled with all processor’s execution time for all tasks. On generated matrix we will apply PCA algorithm to choose processor which take less execution time for selected task. This process continues till all task assigned to all processors. By applying PTCT algorithm we can further decrease computation and communication cost at cloud side. To implement this paper, we design 3 algorithms in the form of simulation and then compare execution/Make span time between them. In all 3 algorithms PTCT algorithms took less execution time for all tasks.

DOI: 10.33545/27075907.2020.v1.i2a.16

Pages: 22-30 | Views: 1468 | Downloads: 1098

Download Full Article: Click Here

International Journal of Cloud Computing and Database Management
How to cite this article:
Maddela Kavya. A novel task scheduling algorithm with improved make span based on prediction of tasks computation time algorithm for cloud computing. Int J Cloud Comput Database Manage 2020;1(2):22-30. DOI: 10.33545/27075907.2020.v1.i2a.16
International Journal of Cloud Computing and Database Management

International Journal of Cloud Computing and Database Management

International Journal of Cloud Computing and Database Management
Call for book chapter