To stimulate the CPU scheduling algorithms for Shortest Job First [closed]

C

Chantel

New Member
Shortest Job First (SJF), is a scheduling policy that selects the waiting process with the smallest execution time to execute next. SJN is a non-preemptive algorithm. Shortest remaining time is a preemptive variant of SJN( Shortest Job Next).Program : To stimulate the CPU scheduling algorithms for Shortest Job Firstfor this program visit java question bank
 
You must log in or register to reply here.
Back
Top