Talk:Shortest remaining time

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

???

This article has not yet received a rating on the project's importance scale.

This article is supported by WikiProject Computer science.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Clarification[edit]

What if the next proces is not shorter but has exactly the same burst time as the currently executing process - is there reason to prefer the new process particularly if one wants to increase the response time of the system? Shedali (talk) 15:40, 2 May 2008 (UTC)[reply]

This question can be avoided by not testing for equality. If the new process has shorter time than remaining time, preemption occurs. --Kvng (talk) 17:22, 25 November 2011 (UTC)[reply]

Why is the currently executing process is the one with the shortest amount of time remaining by definition?[edit]

Currently, the article claims that "the currently executing process is the one with the shortest amount of time remaining by definition". I can see how that would be the case for non-preemptive scheduling, but it seems a mistake for preemptive scheduling. If Bob is working on his thesis, and his wife asks him to take out the garbage, then the latter job clearly has the shorter remaining time. Bob can not use this article as an excuse. — Sebastian 10:39, 15 January 2018 (UTC)[reply]

The garbage task would be the "new process is added that requires a smaller amount of time" part covered in the same sentence, and would thus preempt the thesis work and become the current task. --Xanzzibar (talk) 23:06, 15 April 2018 (UTC)[reply]