서지주요정보
결함허용 실시간 시스템의 응답성을 향상시키는 고정우선순위 스케쥴링 알고리즘 = A fixed-priority scheduling algorithm with improved responsiveness for fault-tolerant real-time systems
서명 / 저자 결함허용 실시간 시스템의 응답성을 향상시키는 고정우선순위 스케쥴링 알고리즘 = A fixed-priority scheduling algorithm with improved responsiveness for fault-tolerant real-time systems / Jong-Kwon Lee.
발행사항 [대전 : 한국과학기술원, 1995].
Online Access 제한공개(로그인 후 원문보기 가능)원문

소장정보

등록번호

8005614

소장위치/청구기호

학술문화관(문화관) 보존서고

MCS 95033

휴대폰 전송

도서상태

이용가능

대출가능

반납예정일

등록번호

9001768

소장위치/청구기호

서울 학위논문 서가

MCS 95033 c. 2

휴대폰 전송

도서상태

이용가능

대출가능

반납예정일

리뷰정보

초록정보

Fault-tolerance as well as timeliness is an important requirement in safty-critical real-time systems such as nuclear-reactor control and aircraft navigation system. But providing fault-tolerance often requires additional time for the recovery operation, which may cause real-time tasks to miss deadline. Recently a responsiveness measure has been proposed to combine the traditional measures of fault-tolerance and real-time with the objective of cooptimizing these dependent system qualities, and it has been applied to the real-time system which provides recovery blocks. A scheduling algorithm which can efficiently manage the additional processing time caused by the recovery operation can improves this measure. In this thesis, a real-time fixed priority scheduling algorithm providing recovery blocks is proposed and its performance is compared with previous algorithms by responsiveness. The proposed algorithm uses rate-monotonic assignments as its base, but considers the characteristics of recovery blocks and assigns proper priorities to them so that each recovery block has its own priority which may be different from the one of its primary task. To use the responsiveness as a performance metric, the complexity problem of evaluating responsiveness is also considered. Evaluation of responsiveness has computational complexity of O(Mㆍ$2^M$), where M is the number of task instances in a major cycle. A method which evaluates an approximated value of responsiveness with high exactness and low complexity is proposed. The proposed method guarantees the lower bound of approximation within given complexity.

서지기타정보

서지기타정보
청구기호 {MCS 95033
형태사항 ii, 46 p. : 삽도 ; 26 cm
언어 한국어
일반주기 부록 수록
저자명의 영문표기 : Jong-Kwon Lee
지도교수의 한글표기 : 이홍규
지도교수의 영문표기 : Heung-Kyu Lee
학위논문 학위논문(석사) - 한국과학기술원 : 전산학과,
서지주기 참고문헌 : p. 43-44
주제 Scheduling (Management)
Fault-tolerant computing.
Real-time data processing.
실시간 처리. --과학기술용어시소러스
스케쥴링 알고리즘
결함 허용
QR CODE qr code