2004•Jisuanji gongcheng yu shejiRequires access

Study of scheduling algorithms in real-time systems

Zhang Hui-jua

Abstract

The scheduling algorithm is an important technology in real-time systems. The popular scheduling algorithms are studied and compared with each other. Much information of these algorithms is introduced, such as scheduling rule, character and environment. The technique used in RTOS is analysed and the problem for enhancing the real-time peromance in RTOS is presented.

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, Real-time operating system, Earliest deadline first scheduling, Fair-share scheduling, Dynamic priority scheduling, Rate-monotonic scheduling, Scheduling (production processes), Fixed-priority pre-emptive scheduling