CO527 Anonymous Questions and Answers Keyword Index |
This page provides a keyword index to questions and answers. Clicking on a keyword will take you to a page containing all questions and answers for that keyword, grouped by year.
To submit a question, use the anonymous questions page. You may find the keyword index and/or top-level index useful for locating past questions and answers.
Keyword reference for preemptive-scheduling
2010 |
Submission reference: IN2029
I am doing the 2009 paper and I have come across a similar problem to the one from Question 19 (2010), in particular the question about preemptive scheduling, is there any information on this in the slides?
It is something that has been mentioned in the lectures and is present in the slides (even if not identified explicitly as such). Basically it's the literal meaning, i.e. the scheduling of some process preempts another. A typical example is when the network card generates an interrupt in response to a packet being received and the interrupt handler (or higher-levels in the device driver or network stack) arranges for the (blocked) process waiting for that packet to run immediately, rather than moving that process to the back of the run-queue and getting its turn eventually. Thus, the scheduling of that particular process preempts whatever process was currently running when the interrupt occurred.
Keywords: preemptive-scheduling
Maintained by Fred Barnes, last modified Sun May 17 14:57:41 2015 |