PRIORITY ( NON-PREEMPTIVE )
P.N.P.
Basic Theory :
Priority Scheduling is a method of scheduling
processes that is based on priority. In this algorithm, the
scheduler selects the tasks to work as per the priority. The
processes with higher priority should be carried out first,
whereas jobs with equal priorities are carried out on a
round-robin or FCFS basis. Priority depends upon memory
requirements, time requirements, etc.
In this type of scheduling method, the CPU has been allocated to a specific process. The process that keeps the CPU busy, will release the CPU either by switching context or terminating. It is the only method that can be used for various hardware platforms. That's because it doesn't need special hardware (for example, a timer) like preemptive
In this type of scheduling method, the CPU has been allocated to a specific process. The process that keeps the CPU busy, will release the CPU either by switching context or terminating. It is the only method that can be used for various hardware platforms. That's because it doesn't need special hardware (for example, a timer) like preemptive
- First input the processes with their arrival time, burst time and priority.
- Sort the processes, according to arrival time if two process arrival time is same then sort according process priority if two process priority are same then sort according to process number.
- Now simply apply FCFS algorithm.