Reducing the Number of Context Switches in Real Time Systems

Author

Paul, A. Arya ; Pillai, B. Anju S

Author_Institution

Dept. of Electr. & Electron. Eng., Amrita Sch. of Eng., Coimbatore, India

fYear

2011

fDate

20-22 July 2011

Firstpage

1

Lastpage

6

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).

Keywords

real-time systems; scheduling; context switch reduction; dynamic preemption threshold scheduling; earliest deadline first scheduling; realtime scheduling; realtime systems; sporadic request scheduling; task set generation; uniprocessor platform; Context; Dynamic scheduling; Heuristic algorithms; Processor scheduling; Protocols; Real time systems; Synchronization;

fLanguage

English

Publisher

ieee

Conference_Titel

Process Automation, Control and Computing (PACC), 2011 International Conference on

Conference_Location

Coimbatore

Print_ISBN

978-1-61284-765-8

Type

conf

DOI

10.1109/PACC.2011.5979044

Filename

5979044