Context switch reduction for delay tolerant activities

Cyber-Physical Systems connect physical infrastructure and things to the internet and to one another by integrating sensing, computation, control, and networking. One of the main optimization objectives for the effective operation of such systems is latency reduction. The key components of Cyber Physical Systems, RTOS (Real Time Operating Systems), contribute significantly to the system’s latency. Different scheduling strategies may be used by a real-time operating system to schedule the system’s task efficiently. One such approach used frequently in contemporary embedded computing is preemptive priority scheduling. The executing component in this sort of scheduling is susceptible to preemption at any time due to the execution of an OS API or the scheduler’s inter-core task assignment. Unaffected by whether the execution context is going to end or self-relinquish, a preemptive scheduler preempts a task. The kernel lacks the ability to detect when a job is about to self-relinquish or when an execution context is ready to finish. The number of context transitions in the system rises as a result of such preemption. A context switch is an expensive process from the operating system’s perspective since it could involve overheads such as MMU table updates, register store restores, bookkeeping and cache reload overhead. The specifics of how to lessen such context changes are covered in this study. The introduction of threshold is discussed in order to stop the kernel from preempting a job that is about to finish or self-relinquish. Additionally, the multi-core instance illustrates how context transitions can be minimised by implementing unique preemption techniques. Our internal simulation test setting demonstrated that a novel preemption method might reduce processing time for the entire system by 2.3 percent.