Journal of Embedded Systems & Its Applications ISSN: 3139-2296 (Online)

Authors:Jigyasa Khurana

Abstract:Embedded systems are widely used in various applications, ranging from consumer electronics to industrial automation. These systems often require real-time task scheduling to meet strict timing requirements. Real-time task scheduling algorithms play a crucial role in determining the efficiency and reliability of embedded systems. This paper presents an overview of real-time task scheduling algorithms for embedded systems, including preemptive and non-preemptive approaches. We discuss popular algorithms such as Rate Monotonic Scheduling (RMS), Earliest Deadline First (EDF), and Deadline Monotonic Scheduling (DMS), highlighting their characteristics, advantages, and limitations. Furthermore, we explore recent advancements in scheduling algorithms that address the challenges posed by complex embedded systems.

Keywords:Real-time task scheduling, Embedded systems, Preemptive scheduling algorithms, Non-preemptive scheduling algorithms, Rate Monotonic Scheduling (RMS), Earliest Deadline First (EDF), Deadline Monotonic Scheduling (DMS), Dynamic Voltage and Frequency Scaling (DVFS), Task partitioning, Multiprocessor systems.