Abstract
Schedulability analysis is a very important part in real-time system research. Because the scenarios faced by real-time systems are very complicated, the functional characteristics must be combined with the predictability of response time. It is necessary to ensure the correctness of the calculation results and meet the real-time requirements. To solve this problem, we propose the IEDF (Improved Earliest Deadline First) algorithm, which is combined with the queuing theory model. The IEDF algorithm is based on the EDF (Earliest Deadline First) algorithm, which is more suitable for the scheduling of real-time embedded system. Scheduling of non-periodic tasks that arrive randomly. There are two types of tasks in the task set, tasks with a high static priority are executed first. In the ready queue of the same priority task, the deadline and execution time are considered. The comparison of simulation experiments shows that: the sum of waiting time in the execution of IEDF with enough deadline is much less than that of ordinary queuing algorithm; the number of errors in the execution of IEDF algorithm with deadline is much less than that of ordinary queuing algorithm. These results demonstrate the feasibility of the IEDF algorithm.
Highlights
The correctness of a real-time system depends on the logical results of the system’s execution, and on the response time for the results
In order to ensure the real-time performance of the real-time system, in this paper, we present an IEDF (Improved Earliest Deadline First) scheduling algorithm
The IEDF algorithm can be applied to non-periodic and randomness tasks, it is more universal than the universality of EDF algorithm
Summary
The correctness of a real-time system depends on the logical results of the system’s execution, and on the response time for the results. In order to ensure the real-time performance of the real-time system, in this paper, we present an IEDF (Improved Earliest Deadline First) scheduling algorithm. (3) We compare the execution results of three algorithms, which are the ordinary queuing algorithm, EDF algorithm and IEDF algorithm It provides a basis for the selection of scheduling algorithms for real-time embedded systems in the future. Kumar et al [8] present a hybrid priority queue architecture and a scalable task scheduler for real-time systems that reduces scheduler processing overhead and improves timing determinism of the scheduler. In IEDF algorithm, the final priority of task scheduling is determined by deadline, but determined by static priority, deadline and execution time together. The matrix is used to represent the service process, the generator matrix of this service process is Q
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have