UGC Approved Journal no 63975(19)
New UGC Peer-Reviewed Rules

ISSN: 2349-5162 | ESTD Year : 2014
Volume 12 | Issue 10 | October 2025

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 11 Issue 10
October-2024
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIRGN06011


Registration ID:
549144

Page Number

89-97

Share This Article


Jetir RMS

Title

TASK SCHEDULING IN CLOUD COMPUTING

Abstract

Cloud computing is an ultra-important infrastructure used to execute tasks over processing units. Despite its numerous benefits, a cloud platform has several challenges that prevent a cloud platform from performing an efficient workflow submission. One of those is related to task scheduling. One of the optimization problems associated with this is the maximal determination of cloud computing scheduling criteria. Existing methods have been unable to find the quality of service (QoS).constraints of the users- such as the economical constraints and minimizing of the makespan. Of all these approaches, the Het‐nerogeneous Earliest Finish Time algorithm generates the maximum results for task scheduling in a heterogeneous environment in minimum time. Literature reviewed proves that HEFT performs well both regarding execution time and schedule quality. B. HEFT Algorithm uses average communication and average computation costs as weightsin the DAG. However, in some cases, the average cost of computation and selecting the first empty slot may not be enough for a good solution to emerge. In the paper at hand we propose different variants of the HEFT algorithm, changed to bring forth improved results. At the first stage, rank generation, several methodologies are run to calculate theranks, and in the second step, we change how the free slots are chosen for task scheduling. These modifica-tions do not incur any extra overhead on the original HEFT algorithm, and reduce the makespan of the virtual machines' workflow submis-sions. We show that performance of the modified versions of the HEFT algorithm is better than the vanilla HEFT algorithm in terms of reduced schedule length of the workflow problems.

Key Words

Cloud Computing, HEFT algorithm, QoS, Task Scheduling,real-time monitoring

Cite This Article

"TASK SCHEDULING IN CLOUD COMPUTING", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 10, page no.89-97, October-2024, Available :http://www.jetir.org/papers/JETIRGN06011.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"TASK SCHEDULING IN CLOUD COMPUTING", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 10, page no. pp89-97, October-2024, Available at : http://www.jetir.org/papers/JETIRGN06011.pdf

Publication Details

Published Paper ID: JETIRGN06011
Registration ID: 549144
Published In: Volume 11 | Issue 10 | Year October-2024
DOI (Digital Object Identifier):
Page No: 89-97
Country: -, -, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

000226

Print This Page

Current Call For Paper

Jetir RMS