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.
2009
2009
Cooperative multithreading in dynamically reconfigurable systems
Preemptive multitasking, a popular technique for timesharing of computational resources in software-based systems, faces… 
Highly Cited
2008
Highly Cited
2008
States of Confusion: The Rise of State and Local Power over Immigration
Federal immigration law has evolved from a stepchild of foreign policy to a national legislative and regulatory scheme that… 
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
2005
Highly Cited
2005
Performance analysis of handoff schemes with preemptive and nonpreemptive channel borrowing in integrated wireless cellular networks
In this paper, we propose and analyze two different handoff schemes in integrated wireless mobile networks. The channels in each… 
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… 
Highly Cited
2004
Highly Cited
2004
A Generic Approach to Schedulability Analysis of Real-Time Tasks
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with… 
1999
1999
Trade-offs between speed and processor in hard-deadline scheduling
This paper revisits the problem of on-line scheduling of sequential jobs with hard deadlines in a preemptive, multiprocessor… 
Highly Cited
1996
Highly Cited
1996
Bicriteria scheduling problem for unrelated parallel machines
1994
1994
Liveness and Fairness in Duration Calculus
This paper embeds durations in an interval temporal logic proposed by Venema. The resulting logic, DCL, is a conservative… 
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… 
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)