• The SRT is the preemptive complement of SJF and helpful in time-sharing environment.
• In SRT scheduling, the process with the least estimated run-time to completion is run next, counting new arrivals.
• In SJF scheme, once a job begins executing, it run to end.
• In SJF scheme, a running progression may be preempted by a new arrival process with shortest predictable run-time.
• The algorithm SRT has higher transparency than its counterpart SJF.
• The SRT must keep track of the beyond time of the running process and must grip occasional preemptions.
• In this scheme, advent of small processes will run almost without delay. on the other hand, longer jobs have even longer mean waiting time.