Skip to content
Q14: Write a program to implement priority scheduling algorithm with context switching time . Prompt to user to enter the number of processes and then enter their priority, burst time and arrival time also. Now whenever operating system preempts a process and shifts cpu’s control to some another process of higher priority assume that it takes 2 …
C
Branch: master
Clone or download

Latest commit

Fetching latest commit…
Cannot retrieve the latest commit at this time.

Files

Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
CODE-CSE316-14.c
CODE-CSE316-14.exe
Code text.txt
Project Report.pdf
README.md

README.md

CSE316-OS-PROJECT

Q14: Write a program to implement priority scheduling algorithm with context switching time . Prompt to user to enter the number of processes and then enter their priority, burst time and arrival time also. Now whenever operating system preempts a process and shifts cpu’s control to some another process of higher priority assume that it takes 2 seconds for context switching (dispatcher latency ).Form a scenario , where we can give the processes are assigned with priority where the lower integer number is higher priority and then context switch .. as the process waits the priority of the process increase at rate of one per 2 time units of wait. Calculate waiting time and turnaround time for each process.

You can’t perform that action at this time.