2003•Microcomputer DevelopmentRequires access

Study of Scheduling Algorithm in Real Time System on Uninprocessors

Zhai Hong

Abstract

The real time scheduling algorithm plays an important rule in the real time systems.The static-priority scheduling algorithm and the dynamic-priority scheduling algorithm are two kinds of scheduling algorithms on uninprocessor systems. Introduces the scheduling algorithm such as RM,DM,EDF,LLF and MLLF,analyses the condition and the problem for these algorithms.

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: Computer science, Dynamic priority scheduling, Earliest deadline first scheduling, Rate-monotonic scheduling, Fair-share scheduling, Two-level scheduling, Round-robin scheduling, Deadline-monotonic scheduling