The Research on Real-Time Scheduling Algorithm in Distributed System

Author

Chengjun, Wang

Author_Institution

Dept. of Comput. Sci. & Technol., WeiFang Univ., Weifang, China

fYear

2009

fDate

19-20 Dec. 2009

Firstpage

71

Lastpage

74

Abstract

Real-time systems are frequently programmed as a collection of short tasks, processes or threads, each with a well-defined function and a well-bounded execution time. The response to a given stimulus may require multiple tasks to be run, generally with constraints on their execution order. In addition, a decision has to be made about which tasks to run on which processors. We will research some of the issues concerning task scheduling in real-time systems, include dynamic and static scheduling.

Keywords

distributed processing; real-time systems; scheduling; distributed system; dynamic scheduling; processors; real-time scheduling algorithm; real-time systems; static scheduling; task scheduling; Computer science; Dynamic scheduling; Equations; Heuristic algorithms; Knowledge engineering; Optimal scheduling; Processor scheduling; Real time systems; Scheduling algorithm; Software engineering; Distributed; Dynamic; Real-Time; Scheduling; algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Knowledge Engineering and Software Engineering, 2009. KESE '09. Pacific-Asia Conference on

Conference_Location

Shenzhen

Print_ISBN

978-0-7695-3916-4

Type

conf

DOI

10.1109/KESE.2009.27

Filename

5383619