Skip to search formSkip to main contentSkip to account menu

Shortest remaining time

Known as: SRPT, Shortest remaining processing time 
Shortest remaining time, also known as shortest remaining time first (SRTF), is a scheduling method that is a preemptive version of shortest job next… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Highest response ratio nextList of algorithmsPreemption (computing)Process (computing)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Whittle index approach to size-aware scheduling for time-varying channels with multiple states
We consider the optimal opportunistic scheduling problem for downlink data traffic in a wireless cell with time-varying channels… 
2011
2011
Fuzzy Priority CPU Scheduling Algorithm
There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based… 
2010
2010
Flow-level stability and performance of channel-aware priority-based schedulers
Channel-aware scheduling in modern wireless networks enables the system to exploit the random rate variations across different… 
2008
2008
Poster session: ASETS: A self-managing transaction scheduler
User satisfaction determines the success of Web-database applications. User satisfaction can be expressed in terms of expected… 
2006
2006
Revisiting unfairness in Web server scheduling
2005
2005
Effects and implications of file size/service time correlation on Web server scheduling policies
Recently, size-based policies such as SRPT and FSP have been proposed for scheduling requests in Web servers. SRPT and FSP are… 
2003
2003
Evolutionary programming for minimizing the average flow time in the presence of non-zero ready times
1993
1993
The variance of delay time in queueing system M/G/1 with optimal strategy SRPT
Review
1993
Review
1993
Properties and applications of the optimal queueing strategy SRPT. A survey
1991
1991
Einsatzmöglichkeiten der Optimalstrategie SRPT in lokalen Rechnernetzen
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)