CPU Scheduling using Priority Scheduling algorithm
Priority Scheduler schedules the processes in the CPU using the priority scheduling algorithm. In the Priority scheduling algorithm is one of the most algorithms used for process scheduling in the batch system. Each process is assigned a priority and based on the priority the process is executed. Processes with same priority are executed based on first come first serve basis. The priority is calculated based on the memory requirements, time requirements and other resource requirement.
- A list with process ids and their priority is maintained.
- The list is sorted in the descending order of the priority of the process.
- The one with the highest priority is executed first and removed from the list
Intel c++ compiler or Microsoft Visual C++ compiler is required for executing.
- Clone the repository in the local machine.
- Change the directory to /PriorityQueue
- Compile the program with the command "gcc priority_implementation.cpp"
- Run the command "./a.out"
- Input the parameters based on the prompt on the screen
The issues can be created in the "https://github.com/varshateratipally/PriorityQueue/"
This repository is created as a part of the course CSCI4830-009