simulates process scheduling in linux OS by graphs and calculations using python
- numpy
- matplotlib
- sys
- run process_generator.py by command line :
python process_generator.py readFile.txt WriteFile.txt
First line should include the number of processes.
Second line should include μ and σ of arrival time distribution separated by a whitespace.
Third line should include μ and σ of burst time distribution separated by a whitespace.
Fourth line should include λ of prioritydistribution
*N.B : you can implement your test cases yourself as you want
- run scheduler.py by command line as follows (or any other way):
python scheduler.py
- file to read (processes data)
First line should include the number of processes.
Each line contains the parameters for one process only, separated by a white space, in the following order:
process number, arrival time, burst time and priority.
- context switching time (if needed).
- scheduling mode :
1. Non-Preemptive Highest Priority First.(HPF)
2. First Come First Served. (FCFS)
3. Round Robin with fixed time quantum.(RR)
4. Preemptive Shortest Remaining Time Next.(SRTN)
- quantum slice in case of (RR) mode.
- HPF :
- FCFS :
- RR :
- SRTN :
-> above graphs are with 0 time context switching for simplicity but you can add any number you want as this fig :
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent