Research and analysis of embedded real-time systems at EDF scheduling algorithm under uncertain environments
XU Bao-lei
Abstract
XU Bao-lei
Abstract
The real-time scheduling algorithms of most embedded systems are adjusted in accordance with the worst execution time scheduling of the mission, which would be a waste of resources. For the real-time application requirements of network multimedia systems, and the deficiencies of the real-time performance of the current scheduling algorithm, this paper firstly analyzes the representative dynamic EDF scheduling algorithm of the embedded real-time system, then sets up a set of models of periodic tasks, based on the model, puts forward an improved EDF scheduling algorithm, and finally verifies the effectiveness of the EDF scheduling algorithm by experiment.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The real-time scheduling algorithms of most embedded systems are adjusted in accordance with the worst execution time scheduling of the mission, which would be a waste of resources. For the real-time application requirements of network multimedia systems, and the deficiencies of the real-time performance of the current scheduling algorithm, this paper firstly analyzes the representative dynamic EDF scheduling algorithm of the embedded real-time system, then sets up a set of models of periodic tasks, based on the model, puts forward an improved EDF scheduling algorithm, and finally verifies the effectiveness of the EDF scheduling algorithm by experiment.
Key concepts: Computer science, Dynamic priority scheduling, Earliest deadline first scheduling, Fair-share scheduling, Rate-monotonic scheduling, Two-level scheduling, Round-robin scheduling, Fixed-priority pre-emptive scheduling