2009jOURNAL OF southwest University for NationalitiesRequires access

Research and analysis of embedded real-time systems at EDF scheduling algorithm under uncertain environments

XU Bao-lei

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Research and analysis of embedded real-time systems at EDF scheduling algorithm under uncertain environments — Research Paper | ScholarLens