![]() Step 2) At time 2, no new process arrives, so you can continue with P1. Step 1) At time=1, no new process arrive. The execution begins with process P1, which has burst time 4. Step 0)Ět time=0, Process P1 and P2 arrive. Each process has its unique priority, burst time, and arrival time. In this type of scheduling algorithm, if a newer process arrives, that is having a higher priority than the currently running process, then the currently running process is preempted.Ĭonsider following five processes P1 to P5. ![]() Lower the number, higher is the priority.In priority scheduling, a number is assigned to each process that indicates its priority level. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |