DEMONSTRATING A SCHEDULING ALGORITHM USING CLOUD COMPUTING
DOI:
https://doi.org/10.5281/zenodo.21375004Keywords:
Cloud Computing, Scheduling Algorithm, FCFS, SJF, Virtual Machine, Task Scheduling, PythonAbstract
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
How to Cite
Issue
Section
License
Copyright (c) 2026 International Educational Journal of Science and Engineering

This work is licensed under a Creative Commons Attribution 4.0 International License.