메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
This paper presents a compiler-based approach to tuning real-time programs under fixed priority scheduling. It has two interrelated components, a static code transformation algorithm and a modified rate-monotonic scheduling method. The code transformation tool decomposes an unschedulable task into two subtasks, one that is time critical and the other that is unobservable. This is made possible by an event-based semantics in that a program's external behavior is determined soly by externally observable events. The tranformation tool glues back the decomposed subtasks such that the time critical subtask finishes before the unobservable one. The new taks substitues the original one in the input task set. For scheduling analysis, the rate-monotonic scheduling approach is used. However, the transformed task is not consistent with rate-monotonic task model in the sense that it has a deadline which constrains only the time critical portion of its exection. To address this problem, we propose a dynamic modification of rate-monotonic scheduling method based on priority exchange. It allows programmers to directly use the simple rate-monotonic schedulability analysis. The code tranformation tool can help real-time programmers in reducing effort at the final stage of development, when fully implemented.

목차

Abstract

Ⅰ. Introduction

Ⅱ. Background

Ⅲ. Automatic Task Decomposition by Program Slicing

Ⅳ. Scheduling and Analysis

Ⅴ. Conclusion

References

저자소개

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-569-017763889