Preemption

Preemption

Preemption is a process in which the operating system scheduler interrupts the execution of a task or process, forcing it to relinquish the processor even if it is still willing to execute. It refers to the ability to stop a task's execution, expecting that it will resume promptly once the break period ends. Preemption occurs at the hardware level, where a hardware timer interrupt occurs, and the CPU takes a thread of execution off the CPU and brings in another one.From: Real-Time Embedded Systems [2017], Optimization of maintenance tasks of spatially distributed assets with non-preemptive overtime [2022], LabVIEW™ Advanced Programming Techniques [2017]

IPC, Task Execution, and Scheduling

View Chapter

Purchase Book

Published in Gedare Bloom, Joel Sherrill, Tingting Hu, Ivan Cibrario Bertolotti, Real-Time Systems Development with RTEMS and Multicore Processors, 2020

Gedare Bloom, Joel Sherrill, Tingting Hu, Ivan Cibrario Bertolotti

On a single-core system, a very straightforward solution to the unbounded priority inversion problem is to forbid preemption completely while a critical region is being executed. This may be obtained by temporarily disabling the operating system scheduler or, even more drastically, turning interrupts off. As a result, any task that successfully enters a critical region implicitly gains the highest possible priority in the system, so that no other task can preempt it. The task goes back to its regular priority when it exits from the critical region.

Introduction

View Chapter

Purchase Book

Published in Joseph Y.-T. Leung, Handbook of SCHEDULING, 2004

Joseph Y.-T. Leung

[66] R. R. Muntz and E. G. Coffman, Jr. Preemptive scheduling of real time tasks on multiprocessor systems. Journal of the ACM,17:324-338,1970.

Optimization of maintenance tasks of spatially distributed assets with non-preemptive overtime

View Article

Journal Information

Published in International Journal of Management Science and Engineering Management, 2022

Hamed Allaham, Doraid Dalalah

While preemption of jobs is a familiar concept in central processing units (CPUs), it is uncommon in maintenance, particularly in non-preemption of the last maintenance task of a working shift. Preemption refers to the ability to stop the task’s execution, expecting that the job will resume promptly once the break period ends. Although Baruah (2006) and others argue that the non-preemptive scheduling of periodic tasks may not be robust, here, we only look into non-preemption of the last task in a specific time frame.

Explore chapters and articles related to this topic

IPC, Task Execution, and Scheduling

Introduction

Optimization of maintenance tasks of spatially distributed assets with non-preemptive overtime