ScholarLens Back to search
2011•Unpublished venueRequires access

Reducing the Number of Context Switches in Real Time Systems

Arya Paul, B. Anju S. Pillai

Open publisher page 8 citations

Abstract

In real time scheduling, preemption is one of the causes of run time overhead and large memory requirements. This paper focuses on reducing the number of preemptions in Earliest Deadline First (EDF) scheduling using a technique called Dynamic Preemption Threshold Scheduling (DPTS) in uniprocessor platform. This method is an improvement over existing threshold algorithms, but the complexity is slightly higher. The simulation results show that context switches are reduced by about 91% on an average. This technique is also applied for scheduling of sporadic requests along with periodic tasks. Preemptions that occur when tasks share resources and are required to synchronize are also reduced in this work. Our work also focuses on task set generation with limited hyperperiod (L.C.M. of periods of the tasks).

About this research paper

What this paper is about

In real time scheduling, preemption is one of the causes of run time overhead and large memory requirements. This paper focuses on reducing the number of preemptions in Earliest Deadline First (EDF) scheduling using a technique called Dynamic Preemption Threshold Scheduling (DPTS) in uniprocessor platform. This method is an improvement over existing threshold algorithms, but the complexity is slightly higher. The simulation results show that context switches are reduced by about 91% on an average. This technique is also applied for scheduling of sporadic requests along with periodic tasks. Preemptions that occur when tasks share resources and are required to synchronize are also reduced in this work. Our work also focuses on task set generation with limited hyperperiod (L.C.M. of periods of the tasks).

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In real time scheduling, preemption is one of the causes of run time overhead and large memory requirements. This paper focuses on reducing the number of preemptions in Earliest Deadline First (EDF) scheduling using a technique called Dynamic Preemption Threshold Scheduling (DPTS) in uniprocessor platform. This method is an improvement over existing threshold algorithms, but the complexity is slightly higher. The simulation results show that context switches are reduced by about 91% on an average. This technique is also applied for scheduling of sporadic requests along with periodic tasks. Preemptions that occur when tasks share resources and are required to synchronize are also reduced in this work. Our work also focuses on task set generation with limited hyperperiod (L.C.M. of periods of the tasks).

Key concepts: Preemption, Uniprocessor system, Computer science, Context switch, Scheduling (production processes), Fixed-priority pre-emptive scheduling, Earliest deadline first scheduling, Distributed computing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Reducing the Number of Context Switches in Real Time Systems — Research Paper | ScholarLens