First Come First Serve Algorithm is OS based Computer graphics Project. This Project as name suggest demonstrate the working of First Come First Serve Algorithm or FCFS Algorithm.
About First Come First Serve Algorithm
The first come first serve (fcfs) algorithm is one of the scheduling algorithms for Process in Operating System. It has the following algorithm -
- In FCFS the process is executed on first come, first serve basis.
- This algorithm is easy to learn, understand and implement.
- The performance of this scheduling algorithm is poor as average wait time is high.
Terminology
Arrival Time : Time of Arrival for Process.
Execute Time : Time taken for execution.
Waiting Time : Time to wait for process it’s execution.
Average Wait Time : Total waiting time/No of Processes.
Instruction to execute Program
To execute this program - run the program with CTR+F5(in windows). First page will have instruction written on it. Press E or e to run the computer graphics project with default values. To run with your own values, give the inputs. Like in our case - press 4 first to give no of process. Then input 2, 3, 6, 7 for arrival time. Next input the execution time 2, 4, 5, 5.
We have wait times for each as in the table -
| Process | Wait Time | Execution Time |
| 1 | 0 | 2 |
| 2 | 1 | 4 |
| 3 | 2 | 5 |
| 4 | 6 | 5 |
Average Wait time = 0+1+2+6/4=9/4=2.25
You easily understand and demonstrate the concept in OS - First Come First Serve Algorithm. With learning from this project do your own the other scheduling algorithms projects on OpenGL. Download the free source and put your comments with respect to this projects.
Note: If You enhanced modify this project plz share your code with, it is a humble request as I single can't help student reach that much of projects. Your Code Will be publish as your with your name only! Thanks !
No comments:
Post a Comment