한국정보처리학회:학술대회논문집 (Proceedings of the Korea Information Processing Society Conference)
- 한국정보처리학회 2002년도 춘계학술발표논문집 (상)
- /
- Pages.687-690
- /
- 2002
- /
- 2005-0011(pISSN)
- /
- 2671-7298(eISSN)
이벤트를 고려한 효과적인 세마포어 구현 알고리듬
An Efficient Semaphore Implementation Scheme with Event
- Han, Ki-Hee (Dept. of Information & Communication, Han-Yang University) ;
- Sihn, Bong-Sik (Dept. of Electronic Engineering, Han-Yang University) ;
- Pi, Chan-Ho (Dept. of Information & Communication, Han-Yang University) ;
- Chong, Jong-Wha (Dept. of Information & Communication, Han-Yang University)
- 발행 : 2002.04.12
초록
In this paper, we present a novel semaphore implementation scheme which shortens finish time of high priority tasks and improves reliability of a system. The real-time systems have time constraints. Especially, the task with hard real-time constraints must meet its deadline. Consequently, managing shared resources is considered guaranteeing mutual exclusion as well as meeting task's deadline under unfavorable condition. According to the number and sort of the locked semaphores under the event occurred, this paper presents the reduction of the finish time of high priority task by decision whether the context switched or not. The experimental results show that the proposed method gives performance improvements in finish time of high priority tasks of about 11% over zuberi[4] method.
키워드