Friday 19th of April 2024
 

An Adaptive Algorithm for Dynamic Priority Based Virtual Machine Scheduling in Cloud


Subramanian S, Nitish Krishna G, Kiran Kumar M, Sreesh P and Karpagam G R

Cloud computing, a relatively new technology, has been gaining immense popularity over the last few years. The number of cloud users has been growing exponentially and apparently scheduling of virtual machines in the cloud becomes an important issue to analyze. This paper throws light on the various scheduling algorithms present for scheduling virtual machines and also proposes a new algorithm that combines the advantages of all the existing algorithms and overcomes their disadvantages.

Keywords: Scheduling, Eucalyptus, Dynamic priority, Cloud.

Download Full-Text


ABOUT THE AUTHORS

Subramanian S
Currently a B.E. degree candidate In Department of Computer Science, P.S.G College of Technology, Coimbatore, India.

Nitish Krishna G
Currently a B.E. degree candidate In Department of Computer Science, P.S.G College of Technology, Coimbatore, India.

Kiran Kumar M
Currently a B.E. degree candidate In Department of Computer Science, P.S.G College of Technology, Coimbatore, India.

Sreesh P
Currently a B.E. degree candidate In Department of Computer Science, P.S.G College of Technology, Coimbatore, India.

Karpagam G R
Professor at the Department of Computer Science, P.S.G College of Technology, Coimbatore, India. Specialization areas include database, service oriented architecture and cloud computing.


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »