Live briefing
Everything about Preemption (computing)
Temporarily interrupting a computer task
In computing, preemption is the act performed by an external scheduler — without assistance or cooperation from the task — of temporarily interrupting an executing task, with the intention of resuming it at a later time. This preemptive scheduler usually runs in the most privileged protection ring, meaning that interruption and then resumption are considered highly secure actions. Such changes to the currently executing task of a processor are known as context switching. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Preemption (computing)A 5-minute orientation
- Pick up a classic book: Modern Operating SystemsThe most-reprinted book on the subject
- Read the landmark paper: Preemption of the Partial Reconfiguration Process to Enable Real-Time Computing With FPGAsCited 26 times
- Go sideways: Computer multitaskingA closely related topic
- Go sideways: List of operating systemsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Preemption of the Partial Reconfiguration Process to Enable Real-Time Computing With FPGAs
Optimizing Peak Age of Information in MEC Systems: Computing Preemption and Non-Preemption
QoS and preemption aware scheduling in federated and virtualized Grid computing environments
Improved Methods of Task Assignment and Resource Allocation With Preemption in Edge Computing Systems
Reinforcement Learning Based Control Scheme for Emergency Vehicle Preemption with Edge Computing
Joint optimization of resources preemption and task queue offloading in vehicular edge computing
📚 Books worth reading
Modern Operating SystemsAndrew S. Tanenbaum, Herbert Bos · 1992
Clean CodeRobert C. Martin · 2008
Intellectual property in the new technological ageRobert P. Merges, Peter S. Menell · 2003- 📕Evaluation of emergency vehicle signal preemption on the Route 7 Virginia corridorDarcy M. Bullock · 1999
Wireless Algorithms, Systems, and ApplicationsKui Ren · 2013- 📕Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligibleKenneth C. Sevcik · 1972
7th UK Computer and Telecommunications Performance Engineering WorkshopJane Elizabeth Hillston · 1992
Autonomous vehicle technologyJames M. Anderson · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Computer multitasking In computing, multitasking is the concurrent execution of multiple tasks (also known as processes) over a certain period of time. New tasks can interrupt…
- List of operating systems This is a list of operating systems. Computer operating systems can be categorized by technology, ownership, licensing, working state, usage, and by many…
- Thread (computing) In computer science, a thread of execution is the smallest sequence of programmed instructions that can be managed independently by a scheduler, which…
- Scheduling (computing) In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The…
- Operating system An operating system (OS) is system software that manages computer hardware and software resources, and provides common services for computer programs.…
- Hang (computing) In computing, a hang or freeze occurs when either a process or system ceases to respond to inputs. A typical example is when a computer's graphical user…
- Exec (Amiga) Exec is the kernel of AmigaOS. It is a 13 KB multitasking microkernel which enabled pre-emptive multitasking in as little as 256 KB of memory (as supplied…
- Fiber (computer science) In computer science, a fiber is a particularly lightweight thread of execution. Like threads, fibers share address space. However, fibers use cooperative…