인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록·키워드
Embedded systems specification usually has both data computation and control structures. Control structure can be two types. One is data dependent control and the other is real time control. The first one can be easily solved because it is involved with only one task and its behavior is very obvious. The problem is the second case. We must use some sophisticated techniques to resolve concurrent behavior of tasks.
To solve the second problem, these tasks require to be scheduled on a shared resource such as processor and memory. This scheduling is mainly based on the system specification. To simulate dynamic behaviors of system, it is very difficult to predict these behaviors because these behaviors have to be determined at compile time and decisions have to be made at run time. In other words, scheduling must be efficiently made while pleasing real time constraints and using the processor and memory resources as efficiently as possible. Therefore, Quasi-static scheduling algorithm is used to solve these problems.
To solve the second problem, these tasks require to be scheduled on a shared resource such as processor and memory. This scheduling is mainly based on the system specification. To simulate dynamic behaviors of system, it is very difficult to predict these behaviors because these behaviors have to be determined at compile time and decisions have to be made at run time. In other words, scheduling must be efficiently made while pleasing real time constraints and using the processor and memory resources as efficiently as possible. Therefore, Quasi-static scheduling algorithm is used to solve these problems.
본문·목차
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.