2010Unpublished venueRequires access

The research of scheduling algorithms in real-time system

Jie Li, Guo Ruifeng, Zhixiang Shao

Open publisher page 19 citations

Abstract

Scheduling algorithm is a hot research topic of real-time system. The quality of real-time scheduling algorithm has a direct impact on real-time system's throughput capacity, response time, even on tasks' scheduling result in required deadline. This paper discusses the features and performance of real-time system. According to system environment, real-time system can be divided into uniprocessor scheduling, centralized multiprocessor scheduling and distributed scheduling. Classic real-time scheduling algorithms RMS, EDF and LLF are discussed in uniprocessor systems. The scheduling thought and strategies are investigated in multiprocessor systems. Distributed real-time scheduling algorithms such as GRMS and DSr are analyzed briefly. Finally, it points out the future direction of real-time scheduling research.

About this research paper

What this paper is about

Scheduling algorithm is a hot research topic of real-time system. The quality of real-time scheduling algorithm has a direct impact on real-time system's throughput capacity, response time, even on tasks' scheduling result in required deadline. This paper discusses the features and performance of real-time system. According to system environment, real-time system can be divided into uniprocessor scheduling, centralized multiprocessor scheduling and distributed scheduling. Classic real-time scheduling algorithms RMS, EDF and LLF are discussed in uniprocessor systems. The scheduling thought and strategies are investigated in multiprocessor systems. Distributed real-time scheduling algorithms such as GRMS and DSr are analyzed briefly. Finally, it points out the future direction of real-time scheduling research.

Why it matters

OpenAlex reports 19 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

Scheduling algorithm is a hot research topic of real-time system. The quality of real-time scheduling algorithm has a direct impact on real-time system's throughput capacity, response time, even on tasks' scheduling result in required deadline. This paper discusses the features and performance of real-time system. According to system environment, real-time system can be divided into uniprocessor scheduling, centralized multiprocessor scheduling and distributed scheduling. Classic real-time scheduling algorithms RMS, EDF and LLF are discussed in uniprocessor systems. The scheduling thought and strategies are investigated in multiprocessor systems. Distributed real-time scheduling algorithms such as GRMS and DSr are analyzed briefly. Finally, it points out the future direction of real-time scheduling research.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
The research of scheduling algorithms in real-time system — Research Paper | ScholarLens