Dae Soo Choi, Jong Kyu Im, Yong Wan Koo

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 11, pp. 3131-3139, Nov. 1999
10.3745/KIPSTE.1999.6.11.3131,   PDF Download:

Abstract

Satisfying the rigid timing requirements of various real-time activities in real time systems often requires some special methods to tune the systems run-time behaviors. Unbounded blocking can be caused when a high priority activity cannot preempt a low priority activity. In such situation, it is said that a priority inversion has occurred. The priority inversion is one of the problems which may prevent thread from meeting the deadlines in the real time systems. It is difficult to remove such priority inversion problems in the kernel at the same time to bound the worst case blocking time for the threads. A thread is a piece of executable code which has access to data and stack. In this paper, a new real time server model, which minimizes the duration of priority inversion, is proposed to reduce the priority inversion problem. The proposed server model provides a framework for building a better server structure, which can not only minimize the duration of the priority inversion, but also reduce the deadline miss ratio of higher priority threads.

Statistics
Cite this article