CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Job Scheduling based on Harmonization between the Requested and Available Processing Power in The Cloud Computing Environment

by Elhossiny Ibrahim, Nirmeen A. El-Bahnasawy, Fatma A. Omara
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 125 - Number 13
Year of Publication: 2015
Authors: Elhossiny Ibrahim, Nirmeen A. El-Bahnasawy, Fatma A. Omara
10.5120/ijca2015906163

Elhossiny Ibrahim, Nirmeen A. El-Bahnasawy, Fatma A. Omara . Job Scheduling based on Harmonization between the Requested and Available Processing Power in The Cloud Computing Environment. International Journal of Computer Applications. 125, 13 ( September 2015), 23-26. DOI=10.5120/ijca2015906163

@article{ 10.5120/ijca2015906163,
author = { Elhossiny Ibrahim, Nirmeen A. El-Bahnasawy, Fatma A. Omara },
title = { Job Scheduling based on Harmonization between the Requested and Available Processing Power in The Cloud Computing Environment },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 125 },
number = { 13 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 23-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume125/number13/22493-2015906163/ },
doi = { 10.5120/ijca2015906163 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:15:58.134154+05:30
%A Elhossiny Ibrahim
%A Nirmeen A. El-Bahnasawy
%A Fatma A. Omara
%T Job Scheduling based on Harmonization between the Requested and Available Processing Power in The Cloud Computing Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 125
%N 13
%P 23-26
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Cloud Computing is a most recent computing paradigm where IT services are provided and delivered over the Internet on demand and pay as you go. On the other hands, the task scheduling problem is considered one of the main challenges in the Cloud Computing environment, where a good mapping between the available resources and the users's tasks is needed to reduce the execution time of the users’ tasks (i.e., reduce make-span), in the same time, increase the degree of capitalization from resources (i.e., increase resource utilization). In this paper, a new task scheduling algorithm has been proposed and implemented to reduce the make-span, as well as, increase the resources utilization by considering independent tasks. The proposed algorithm is based on calculating the total processing power of the available resources (i.e., VMs) and the total requested processing power by the users' tasks, then allocating a group of users' tasks to each VM according to the ratio of its needed power corresponding to the total processing power of all VMs. To evaluate the performance of the proposed algorithm, a comparative study has been done among the proposed algorithm, and the existed GA, and PSO algorithms. The experimental results show that the proposed algorithm outperforms other algorithms by reducing make-span and increasing the resources utilization.

References
  1. A. Soror, U. F. Minhas, A. Aboulnaga, K. Salem, P. Kokosielis, and S. Kamath, "Deploying Database Appliances in the Cloud.," IEEE Data Eng. Bull., vol. 32, No. 1, PP. 13-20, 2009.
  2. Rajveer Kaur, Supriya Kinger, "Analysis of Job Scheduling Algorithms in Cloud Computing", International Journal of Computer Trends and Technology (IJCTT) , vol. 9 No. 7, PP. 379-386, Mar 2014.
  3. A.jangra, and T.Saini. "Scheduling Optimization in Cloud Computing." International Journal of Advanced Research in Computer Science and Software Engineering", IJARCSSE 3, PP. 62-65. April 2013.
  4. Handbook of Cloud Computing [online]. Available:http://www.springerlink.com/index/10.1007/978-1-4419-6524-0.
  5. Sanjaya K. Pandaa, Indrajeet Guptab and Prasanta K. Janac, " Allocation-
  6. Aware Task Scheduling for Heterogeneous Multi-Cloud Systems", ScienceDirect, PP. 50176-184, 2015.
  7. Y. Yang, et al., " An Algorithm in SwinDeW-C for Scheduling Transaction- Intensive Cost-Constrained Cloud Workflows," Proc. of 4th IEEE International Conference on e-Science, Indianapolis, USA, PP. 374-375, December 2008.
  8. Suraj Pandey, Linlin Wu, Siddeswara Guru, and Rajkumar Buyya. "A Particle Swarm Optimization (PSO)-based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments." Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications (AINA), Perth, Australia. April 20-23, 2010.
  9. Ke Liu, Hai Jin, Jinjun Chen, Xiao Liu, Dong Yuan, Yun Yang , " A Compromised-Time-Cost Scheduling Algorithm in SwinDeW-C for Instance-Intensive Cost-Constrained Workflows on a Cloud Computing Platform," International Journal of High Performance Computing Applications - IJHPCA , vol. 24, No. 4, PP. 445-456, 2010
  10. Saeed Parsa and Reza Entezari-Maleki,” RASA: A New Task Scheduling Algorithm in Grid Environment” in World Applied Sciences Journal (Special Issue of Computer & IT), PP. 152-160, 2009.
  11. J.Huang. "The Workflow Task Scheduling Algorithm Based on the GA Model in the Cloud Computing Environment." Journal of Software, vol. 9, No 4, PP. 873-880, April 2014.
  12. Lei Zhang, et al. "A Task Scheduling Algorithm Based on PSO for Grid Computing." International Journal of Computational Intelligence Research, vol. 4, No.1, PP. 37–43, 2008.
  13. Cui Lin, Shiyong Lu,” Scheduling ScientificWorkflows Elastically for Cloud Computing” in IEEE 4th International Conference on Cloud Computing, 2011.
  14. Visalakshi, and Sivanandam. "Dynamic Task Scheduling with Load Balancing using Hybrid Particle Swarm Optimization." International Journal of Open Problems in Computer Science and Mathematics, ICSRS Publication, vol. 2, No. 3, PP. 476-488, 2009.
  15. Mrs.S.Selvarani1, Dr.G.Sudha Sadhasivam, "Improved Cost-based Algorithm for Task Scheduling in Cloud Computing, India, , IEEE , PP. 620–624, 2010.
  16. Yang, et al. "An Utility- based Job Scheduling Algorithm for Cloud Computing Considering Reliability Factor". Proceedings of the 2011 International Conference on Cloud and Service Computing, IEEE Xplore Press, Hong Kong, PP. 95-102, Dec. 12-14.
  17. S.Singh, M.Kalra, "Task Scheduling Optimization of Independent Tasks in Cloud Computing Using Enhanced Genetic Algorithm," International Journal of Application or Innovation in Engineering & Management, vol. 3, Issue 7, PP. 2319 – 4847, July 2014.
  18. U. University, " The HPC2N Seth log, " 2006. [Online]. Available:http://goo.gl/wrxAK.
Index Terms

Computer Science
Information Sciences

Keywords

Cloud Computing Task scheduling Particle swarm optimization Genetic Algorithm.

Powered by PhDFocusTM