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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, we consider a continuous-time retrial queue with two classes of customers: priority customers and ordinary… 
2010
2010
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high… 
2007
2007
We consider a system that is subject to random failures, and investigate the decision rule for performing renewal maintenance or… 
2006
2006
This paper presents a novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems. We… 
2004
2004
Resource allocation is a vital component of call-admission control that determines the amount of resource to assign to new and… 
2001
2001
Multiprotocol label switching (MPLS) is known as one of the most important technologies for solving many problems over the… 
1999
1999
This paper revisits the problem of on-line scheduling of sequential jobs with hard deadlines in a preemptive, multiprocessor… 
Highly Cited
1991
Highly Cited
1991
M/G/1. Queue Size and Waiting Time. Busy Period. LCFS and Random Order of Service. Batch Arrival Systems. Output Processes…