DEMONSTRATING A SCHEDULING ALGORITHM USING CLOUD COMPUTING

Authors

  • Nidhi S. M. Department of Electronics and Communication Engineering, Sharanbasava University, Kalaburagi, India

DOI:

https://doi.org/10.5281/zenodo.21375004

Keywords:

Cloud Computing, Scheduling Algorithm, FCFS, SJF, Virtual Machine, Task Scheduling, Python

Abstract

Cloud computing helps in sharing resources and running tasks easily using virtualization. Task scheduling is important to improve performance and save time. This project uses Python to implement two scheduling methods: First Come First Serve (FCFS) and Shortest Job First (SJF). The program takes task times as input and assigns them to two virtual machines. FCFS runs tasks in the same order they are entered, while SJF runs smaller tasks first. The output shows how tasks are divided and the total time taken by each virtual machine.

References

I. Rajkumar Buyya, “Cloud Computing Principles and Paradigms,” Wiley Publications, 2011.

II. Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne, “Operating System Concepts,” 9th Edition, Wiley, 2013.

III. Kai Hwang, Geoffrey Fox, and Jack Dongarra, “Distributed and Cloud Computing,” Morgan Kaufmann, 2012.

IV. Python Software Foundation, “Python Documentation,” Available: https://www.python.org/

V. A. Tanenbaum, “Modern Operating Systems,” Pearson Education, 2014

Additional Files

Published

01-06-2026

How to Cite

Nidhi S. M. (2026). DEMONSTRATING A SCHEDULING ALGORITHM USING CLOUD COMPUTING. International Educational Journal of Science and Engineering, 9(05), 119–121. https://doi.org/10.5281/zenodo.21375004