-
Notifications
You must be signed in to change notification settings - Fork 0
Abhikrgupta/Abhishek_OS-Project
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
# OS-Project Question: Design a scheduling program to implement a Queue with two levels: Level 1: Fixed priority preemptive Scheduling. Level 2: Round Robin Scheduling For a fixed priority preemptive scheduling (Queue 1), the priority 0 is highest priority. If one process P1 is scheduled and running, another process P2 with higher priority comes. The new process (higher priority) process P2 preempts currently running process P1 and process P1 will go to second level queue. Time for which process will strictly execute must be considered in the multiples of 2. All the processes in the second level queue will complete their execution to round robin scheduling. Consider: 1. Queue 2 will be processed after Queue 1 becomes empty. 2. Priority of Queue 2 has lower priority than in Queue 1.
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published