An efficient dynamic scheduling algorithm for periodic tasks in real-time systems using dynamic average estimation

Real-time embedded systems have become widely used in many fields such as control, monitoring and aviation. They perform several tasks under strict time constraints. In such systems, deadline miss may lead to catastrophic results so that all jobs need to be scheduled appropriately to ensure that they meet their deadline times. This paper presents an efficient dynamic scheduling algorithm during run-time to schedule periodic tasks in multiprocessor environments and uniprocessor as well using a dynamic average estimation. Dynamic average estimation refers to changing in different probability distributions when a task is added or removed from them. It is not always available a value of Worst-Case Execution Time (WCET) in many real-time applications such as multimedia where data has a great variation. The proposed approach selects which task or a set of tasks must be picked up for execution. A simulation system was developed to show validation of the proposed approach.