2008•Journal of Northeastern UniversityRequires access

Implementation of Dynamic-Priority Scheduling Algorithm and EDF Algorithm in WebitOS

Luo Ding-ding

Abstract

Compared with the static-priority scheduling algorithms in real-time system,the dynamic-priority scheduling algorithms,which can set different deadlines for different jobs of each and every task to reflect the time constraint on tasks better.A dynamic-priority scheduling algorithm designed and implemented in the WebitOS real-time operating system on the basis of the high availability scheduling of earliest deadline first(EDF) algorithm with an early discarding rule specified for next job.Test results showed that the rule enhances the scheduling performance of the EDF algorithm as a whole under over-loaded condition.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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: Earliest deadline first scheduling, Dynamic priority scheduling, Computer science, Rate-monotonic scheduling, Deadline-monotonic scheduling, Fair-share scheduling, Algorithm, Fixed-priority pre-emptive scheduling