2006•Computer Technology and DevelopmentRequires access

Feasibility Test and Realization Based on EDF Algorithm

Hong Yan-wei, Juan Lai

Abstract

The real time scheduling algorithm plays an important role in the real time systems.The test for scheduling algorithm is a very important step.The static priority scheduling algorithm and the dynamic priority scheduling algorithm are two kinds of scheduling algorithms on real time systems.Analyses the condition and the problem for EDF scheduling algorithms.Present a method for testing scheduling algorithm based on the response time of tasks in the worst condition for simple model and complex model.Determine the basis to realize this real-time scheduling algorithm for the practical application.

About this research paper

What this paper is about

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

Key concepts: Computer science, Dynamic priority scheduling, Earliest deadline first scheduling, Rate-monotonic scheduling, Fair-share scheduling, Two-level scheduling, Round-robin scheduling, Algorithm