CFP last date
20 June 2024
Reseach Article

Optimized Resource Filling Technique for Job Scheduling in Cloud Environment

Published on December 2013 by A V. Karthick, E. Ramaraj, R. Kannan
International Conference on Computing and information Technology 2013
Foundation of Computer Science USA
IC2IT - Number 3
December 2013
Authors: A V. Karthick, E. Ramaraj, R. Kannan
0e8b4f6e-1b24-4f5e-915d-32c2951cce19

A V. Karthick, E. Ramaraj, R. Kannan . Optimized Resource Filling Technique for Job Scheduling in Cloud Environment. International Conference on Computing and information Technology 2013. IC2IT, 3 (December 2013), 1-5.

@article{
author = { A V. Karthick, E. Ramaraj, R. Kannan },
title = { Optimized Resource Filling Technique for Job Scheduling in Cloud Environment },
journal = { International Conference on Computing and information Technology 2013 },
issue_date = { December 2013 },
volume = { IC2IT },
number = { 3 },
month = { December },
year = { 2013 },
issn = 0975-8887,
pages = { 1-5 },
numpages = 5,
url = { /proceedings/ic2it/number3/14398-1332/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Computing and information Technology 2013
%A A V. Karthick
%A E. Ramaraj
%A R. Kannan
%T Optimized Resource Filling Technique for Job Scheduling in Cloud Environment
%J International Conference on Computing and information Technology 2013
%@ 0975-8887
%V IC2IT
%N 3
%P 1-5
%D 2013
%I International Journal of Computer Applications
Abstract

Job scheduling is one the complicated problem in Cloud Computing. We intend a grouping method to develop the combinational backfill algorithm based on smadium and long queue technique using random fashion. The proposed algorithm helps to improve the resource gap, reduce the system idle time and helps to attain high resource usage and provide quality system in cloud environment. To make the most efficient use of the resources, accomplish the optimization for cloud scheduling problems. It is not possible to predict the job execution time in cloud environment. Hence the scheduler must be dynamic. Previous Scheduling strategies like FCFS, SJF, Round Robin and CBA are deficient in filling the Resources gap effectively and create more fragmented space. The Proposed work, Optimized Resource Filling (ORF) properly utilize the resources and increase the unused available working space and reduce starvation, when compared to traditional and balance spiral method. Its ultimate goal is to produce high usage of available resources, balance the system and reduce system unused time and to improve throughput of the system. This paper introduce smadium concept for cloud resource management. ORF tries to fill the unused space created by the scheduler.

References
  1. Alexander. M. , Lindsay. , Maxwell. Galloway Carson. , Christopher. R. Johnson. , David. P. Bunde. , Vitus. J. Leung. Backfilling with guarantees granted upon job Submission. Work done while Alex was a student at Knox College.
  2. Chiang. S. H. , Dusseau. A. A. , Vernon. M. K. 2002 The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance. In Job Scheduling Strategies for Parallel Processing, 103-127.
  3. Daniel. D. , Jeno Lovesum. S. P. 2011 A Novel Approach for Scheduling Service Request in Cloud with Trust Monitor. Proceedings of 2011 International Conference on Signal Processing, Communication, Computing and Networking Technologies. ICSCCN.
  4. Dejan. Perkovi?. , Peter. J. Keleher. 2000 Randomization Speculation and Adaptation in Batch Schedulers. IEEE.
  5. Feitelson. D. G. , Rudolph. L. , Schwiegelshohn . U. 2005 Parallel Job Scheduling-A Status Report. Lecture Notes in Computer Science. Job Scheduling Strategies for Parallel Processing. Springer Berlin, 1-16.
  6. Loganayagi. B. , Sujatha. S. 2010 Creating Virtual Platform for Cloud Computing. IEEE.
  7. Martin. Randles. , David. Lamb. , Taleb-Bendiab. A. 2010 A Comparative Study into Distributed Load Balancing Algorithms for Cloud Computing. IEEE 24th International Conference on Advanced Information Networking and Applications Workshops.
  8. Mu'alem. A. W. , Feitelson. D. G. 2001 Utilization Predictability Workloads and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems, 529-543.
  9. Selvarani. S. , Sudha Sadhasivam. G. 2010 Improved cost based algorithm for task scheduling in cloud computing. IEEE.
  10. Shengwei, YI1. ,†. , Zhichao, WANG1. , Shilong, MA1. , Zhanbin, CHE1. , Yonggang HUANG2. , Xin, CHEN1. 2010. An Effective Algorithm of Jobs Scheduling in Clusters, Journal of Computational Information Systems, 3163-3171.
  11. Sofia. K. , Dimitriadou. 2010 Job Scheduling in a Distributed System Using Backfilling with Inaccurate Runtime Computations. International Conference on Complex, Intelligent and Software Intensive Systems.
  12. Srividya. Srinivasan. , Rajkumar. Kettimuthu. , Vijay. Subrarnani. , Sadayappan. P. 2002 Characterization of Backfilling Strategies for Parallel Job Scheduling. Proceedings of the International Conference on Parallel Processing Workshops. IEEE.
  13. Sudha. S. V. , Thanushkodi. K. 2008 An Approach for Parallel Job Scheduling using Nimble Algorithm. IEEE.
  14. Suresh. A#1. , Vijayakarthick. P#2. 2011 Improving scheduling of backfill algorithms using balanced spiral method for cloud metascheduler. IEEE-International Conference on Recent Trends in Information Technology.
  15. Xin. Lu. , Zilong. Gu. 2011 A Load-Adapative Cloud Resource Scheduling model based on Ant Colony Algorithm. Proceedings of IEEE CCIS
Index Terms

Computer Science
Information Sciences

Keywords

Optimized Resource Filling Smadium Random Fashion.