Skip to search formSkip to main contentSkip to account menu

Preemption (computing)

Known as: Pre-emptive multitasking, Preemptive scheduling, Pre-emptive multi-tasking 
In computing, preemption is the act of temporarily interrupting a task being carried out by a computer system, without requiring its cooperation, and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
"Classic" Mac OSAndroidApache HadoopBusy waiting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
A fuzzy goal programming approach with priority for channel allocation problem in steel industry
2007
2007
Potential performance bottleneck in Linux TCP
Transmission control protocol (TCP) is the most widely used transport protocol on the Internet today. Over the years, especially… 
Highly Cited
2005
Highly Cited
2005
Real time spectrum markets and interruptible spectrum: new concepts of spectrum use enabled by cognitive radio
Historically spectrum use has been increased through use of high frequencies, improved modulation, and between antenna techniques… 
Highly Cited
2004
Highly Cited
2004
Reducing the number of preemptions in fixed priority scheduling
  • R. DobrinG. Fohler
  • Proceedings. 16th Euromicro Conference on Real…
  • 2004
  • Corpus ID: 18964314
Fixed priority scheduling (FPS) has been widely studied and used in a number of applications, mostly due to its flexibility… 
2001
2001
Stability of Earliest-Due-Date, First-Served Queueing Networks
  • M. Bramson
  • Queueing Syst. Theory Appl.
  • 2001
  • Corpus ID: 22047288
We study multiclass queueing networks with the earliest-due-date, first-served (EDDFS) discipline. For these networks, the… 
Highly Cited
1997
Highly Cited
1997
Fuzzy goal programming approach for water quality management in a river basin
1997
1997
Prescription in the macedonian novels on preemption: a linguistic, legal and political inquiry
Highly Cited
1993
Highly Cited
1993
Queuing spin lock algorithms to support timing predictability
  • Travis S. Craig
  • Proceedings Real-Time Systems Symposium
  • 1993
  • Corpus ID: 2059726
We introduce practical new algorithms for FIFO and priority-ordered spin locks on shared-memory multiprocessors with an atomic… 
Highly Cited
1991
Highly Cited
1991
Vacation and priority systems
M/G/1. Queue Size and Waiting Time. Busy Period. LCFS and Random Order of Service. Batch Arrival Systems. Output Processes… 
Highly Cited
1979
Highly Cited
1979
Minimizing Maximum Lateness in a Two-Machine Open Shop
We consider the problem of scheduling independent jobs in a two-machine open shop so as to minimize the maximum lateness with… 
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)