International Journal of Computer Engineering and Applications,

Volume XI, Issue VIII, August 17, www.ijcea.com ISSN 2321-3469

IMPROVED TASK SCHEDULING MODEL WITH TASK GROUPI

NG FOR COST AND TIME OPTIMIZATION
Shiva, Dr Anurag Jain
Department of Computer science and Engineering CEC Landran

ABSTRACT:
The existing models are based upon the quality of service (QoS) integration for the purpose of
task prioritization and cost based scheduling for the client’s convenience, i.e. quick and minim
ized time based scheduling. The existing models are not found efficient enough in the differen
t ways, which states the various shortcomings of the existing models. The existing model (Anto
n Belogazov, 2012) does not incorporates the concept of the task group aggregation (also kno
wn as task clustering) to segregate the tasks on the basis of their dependency. The dependent t
asks can be grouped altogether to prepare the task chains which are scheduled sequentially, a
nd in the parallel processing manner with other task groups belonging to the one task batch. I
n such way, the unnecessary burden can be reduced from the machines lying in the sleeping s
tate to minimize the complexity of scheduling for processing of target task group (or cluster).
Keywords: Cloud scheduling, task scheduling, QoS, cloud cluster management.

[1] INTRODUCTION

Cloud computing is one of the fieriest, evolving technology in the IT world. The term
cloud is parallel to the Internet. But in the actual cloud computing model, this means
having all the software and data held on a server or a group of servers, and accessing
them through the internet. In some cases the client is simply a device furnished with a
nominal OS and running a web browser. The National Institute of Standards and
Technology (NIST) interprets cloud computing as “Cloud computing is a framework for
empowering ubiquitous, appropriate, on-demand network access to a shared pool of
configurable computing resources (e.g., networks, servers, storage, applications, and

Shiva and Dr Anurag Jain

26
IMPROVED TASK SCHEDULING MODEL WITH TASK GROUPING FOR COST AND TIME
OPTIMIZATION

services) that can be speedily provisioned and released with minimal management effort
or service provider interaction”. This cloud model is composed of five essential
characteristics, three service models, and four deployment models [1]. Parallel and
distributed computing has been entered into the era of cloud computing which provides
highly scalable, secure and fast IT services through the internet. So it has captured the
attention of big IT giant for availing readily elastic and cost effective economical IT
operations. A methodology of computing where enormously scalable IT-related abilities
are produced as a service across the internet to multiple external customers using internet
technologies as cloud computing defines by Gartner. [2] Cloud computing caters to the
following needs [3] [9]:

1. Dynamism: Cloud computing provides dynamism, means we can increase or decrease

demand of resources as and when required according to our needs. For this we need to
just configure and the service provider will take care of fluctuating demands.
2. Abstraction: Cloud computing provides abstraction to the end users. The end users do
not need to care for the plug-ins, web security, software platform . All these things are
abstracted from users in the cloud.
3. Resource sharing: Cloud computing provides resource sharing which allows optimum
utilisation of resources in the cloud. The cloud architecture is executed in such a way
that it deliverss you the pliability to division of application as well as other network
resources.

[2] LITERATURE REVIEW

Zhao, Qing et. al. [1] have worked towards the new energy-aware task scheduling met
hod for data-intensive applications in the cloud. In this method, first, the datasets and t
asks are modeled as a binary tree by a data correlation clustering algorithm, in which b
oth the data correlations generated from the initial datasets and that from the intermed
iate datasets have been considered. Nidhi Bansal et. al. [4] have worked upon the cost
performance optimization based upon the QoS driven tasks scheduling in the cloud co
mputing environments. The authors have focused upon the cost of the computing reso
urces (virtual machines) to schedule the given pool of the tasks over the cloud comput
ing model. Gaurang patel et. al. [3] have worked upon the enhancement in the existing
algorithm of Min-Min for the task scheduling on the cloud environment. The authors h
ave proposed the use of active load balancing in processing the tasks over the cloud en
vironments. Weiwei Chen et. al. [5] have proposed the imbalanced metrics for the opt
imization of the task clustering on the scientific workflow data executions. The author
s have examined the imbalanced nature of the task clustering during the runtime evalu
ation for the purpose of task clustering in depth. The authors have proposed the impro
vement to effectively evaluate the problem of the runtime task imbalance. Y. Tan et. a
l [6] proposed a new task scheduling model in this paper. In the proposed model, auth
or optimize the task execution time to interpretation both the job running time and the
resource utilization. So, a PSO-based algorithm is proposed based on the model. In pr
oposed algorithm, author improved the standard PSO, and introduced a simple mutati
on procedure and a self-adapting inertia weight practice by classifying the fitness valu

Shiva and Dr Anurag Jain

27
 International Journal of Computer Engineering and Applications,
Volume XI, Issue VIII, August 17, www.ijcea.com ISSN 2321-3469

es. K. Li et.al [7] described in this paper as the cloud computing is the expansion of pa
rallel computing, grid computing and distributed computing. Task scheduling is one o
f the elementary issues in this environment. Many meta heuristic algorithms have bee
n developed to solve Cloud task scheduling. X. Luo et al. [8] proposed an algorithm f
or resources scheduling under cloud computing environment. It is different from that u
nder conventional distributed computing domain because of the high scalability and h
eterogeneity of computing resources in cloud computing domain. In this paper, based
on dynamic load balance the author has proposed a resource-scheduling algorithm . T
he different statistic transferring power and retard between nodes in cloud as well stati
stic-processing power of nodes in cloud is considered in this algorithm.

[3] FINDINGS OF LITERATURE REVIEW

1. The energy efficient has been remained the key issue behind the development of the
energy aware resource allocation heuristics for efficient management (Anton
Beloglazov, 2012). The integration of task group clustering can be utilized for the
purpose of specific VM group selection, which can be utilized to avoid the other VMs
from sleeping to active state, which can further reduce the energy consumption.
2. The existing scheme (Kris Braekers, 2016) does not analyze the real-time like aspects,
which includes the data transmission times and temporal dependencies between the
jobs, which must be incorporated in the dynamic job scheduling algorithm to develop
the more efficient and dynamic algorithm.
3. The working time prediction for the task group may prove to be more efficient for the
cloud based task scheduling jobs, which has not been performed in both of the schemes.
(Anton Beloglazov, 2012 & Kris Braekers, 2016)

[4] CONCLUSION

The existing model can be improved by using the various innovative methods along w
ith the existing schemes. The task grouping algorithm will be implemented to divide t
he task batch in the groups (or clusters) on the basis of dependency tree. The task gro
ups can undergo the parallel processing mechanism to minimize the complexity and s
cheduling time. Also, the inclusion of the dynamic time based parameters, such as tra
nsmission time and temporal dependencies as the scheduling parameters can further i
mprove the overall performance of the task scheduling method. The working time pre
diction, which can predict the overall time taken for the processing of the task group
with high precision, can add more flexibility to the task scheduling model.

Shiva and Dr Anurag Jain

28
IMPROVED TASK SCHEDULING MODEL WITH TASK GROUPING FOR COST AND TIME
OPTIMIZATION

REFERENCES
[1] Zhao, Qing, Congcong Xiong, Ce Yu, Chuanlei Zhang, and Xi Zhao. "A new energy-aware tas
k scheduling method for data-intensive applications in the cloud." Journal of Network and Comput
er Applications 59 (2016): 14-27.

[2] Braekers, Kris, Richard F. Hartl, Sophie N. Parragh, and Fabien Tricoire. "A bi-objective home
care scheduling problem: Analyzing the trade-off between costs and client inconvenience." Europe
an Journal of Operational Research248, no. 2 (2016): 428-443.

[3] Patel, Gaurang, Rutvik Mehta, and Upendra Bhoi. "Enhanced Load Balanced Min-min Algorith
m for Static Meta Task Scheduling in Cloud Computing."Procedia Computer Science 57 (2015): 5
45-553.

[4] Bansal, Nidhi, Amitab Maurya, Tarun Kumar, Manzeet Singh, and Shruti Bansal. "Cost perfor
mance of QoS Driven task scheduling in cloud computing." Procedia Computer Science 57 (2015):
126-130.

[5] Lin, Weiwei, Chen Liang, James Z. Wang, and Rajkumar Buyya. "Bandwidth‐aware divisible t
ask scheduling for cloud computing." Software: Practice and Experience 44, no. 2 (2014): 163-174
.

[6] Liu, Zhanghui, and X.Wang. "A PSO-based algorithm for load balancing in virtual machines o
f cloud computing environment," Advances in Swarm Intelligence, Springer Berlin, pp.142-147, 20
12.

[7] K.Li, G.Xu, G. Zhao, Y. Dong, and D. Wang “Cloud Task scheduling based on Load Balancin
g Ant Colony Optimization,” 6th IEEE Annual China Grid Conference , pp 3-9, 2011.

[8] Chang, Haihua, and X.Tang. "A load-balance based resource-scheduling algorithm under cloud c
omputing environment," 9th International Conference on Web-based Learning, Springer, Berlin, pp. 8
5–90, 2011.

[9] S.Cavić, Vesna, and E. Kühn, “Self-Organized Load Balancing through Swarm Intelligence,” In N
ext Generation Data Technologies for Collective Computational Intelligence, Springer, Berlin pp. 19
5-224, 2011.

[10] A. Jain and R. Singh, “An Innovative Approach of Ant Colony Optimization for Load Balancin
g Peer to Peer Grid Environment,” IEEE International Conference of
Issues and Challenges in Intelligent Computing Techniques , pp. 1-5, 2014.

[11] R. Chaukwale and S.S. Kamath, “A Modified Ant Colony Optimization Algorithm with Load
balancing for Job Shop Scheduling,” 15 th IEEE International Conference on
Advanced Computing Technologies , pp. 1–5, 2013.

[12] S. Dam, G. Mandal, K. Dasgupta, and P. Dutta "An Ant Colony Based Load Balancing Strateg
y in Cloud Computing," In Advanced Computing, Networking and Informatics Springer, vol 2, pp.
403-413, 2014.

[13] S. K Goyal and M. Singh “Adaptive and Dynamic Load Balancing in Grid Using Ant Colony
Optimization,” International Journal of Engineering and Technology, vol. 4, issue 4, pp.167-174, 2
012.

[14] S.K Dhurandher, M. S. Obaidat, P. Agarwal, A. Gupta, and P.Gupta, “A Cluster-Based Load B
alancing Algorithm in Cloud Computing,” IEEE International Conference on Communications, Sy
dney, pp.2921 – 2925, 2014

Shiva and Dr Anurag Jain

29
International Journal of Computer Engineering and Applications,
Volume XI, Issue VIII, August 17, www.ijcea.com ISSN 2321-3469

[15] Gaochao Xu, Junjie Pang, and Xiaodong Fu “A Load Balancing Model Based on Cloud Partitio
ning for the Public Cloud,” IEEE Transactions in Tsinghua Science and Technology, vol -18, issue
1, pp 34-39, 2013.

Shiva and Dr Anurag Jain

30