A Research on Dynamic Scheduling Algorithm of Real-Time Operating Systems on Uniprocessor

Abstract:

Article Preview

Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of real-time operating systems become an important measure to determine the real-time capability of a system. In this paper, we discuss the dynamic priority scheduling algorithm –Priority Inheritance Scheduling Algorithm. Then we analyze the algorithm from two aspects: description and schedulability.

Info:

Periodical:

Advanced Materials Research (Volumes 219-220)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

40-44

DOI:

10.4028/www.scientific.net/AMR.219-220.40

Citation:

K. Shang and H. Ding, "A Research on Dynamic Scheduling Algorithm of Real-Time Operating Systems on Uniprocessor", Advanced Materials Research, Vols. 219-220, pp. 40-44, 2011

Online since:

March 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.