Park Hung Bog, Yoo Weon Hee

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 1, pp. 119-129, Jan. 1995
10.3745/KIPSTE.1995.2.1.119,   PDF Download:

Abstract

In this paper, we propose a schedulability analysis method for real-time programs. Several approaches to analyzing schedulability have been developed, but since these approaches use a fixed priority scheduling method and/or traverse all possible state spaces, there take place exponential time and space complexity of these methods. Therefore it is necessary to reduce the state space and detect schedulability at earlier time. Our schedulability analysis method uses a minimum unit time taken to terminate synchronization action, a minimum unit time taken to terminate actions after synchronization, and a deadline of processes to detect unschedulability at earlier time and dynamic scheduling scheme to reduce state space. We conclude that our method can detected unschedulability earlier 50 percent unit time than Fredette's method.

Statistics
Cite this article