| 한글제목(Korean Title) |
산발적인 경성 실시간 태스크를 위한 온라인 스케줄링 알고리즘 |
| 영문제목(English Title) |
On-line Scheduling Algorithms for Hard Real-Time Sporadic Tasks |
| 저자(Author) |
조성제
이석균
유해영
Seongje Cho
Sukkyoon Lee
Haeyoung Yoo
|
| 원문수록처(Citation) |
VOL 25 NO. 07 PP. 0708 ~ 0718 (1998. 07) |
한글내용
(Korean Abstract) |
매우 복잡한 분산 실시간 시스템을 개발하는데 있어 실시간 운영체제의 다중처리기 지원이 필수적이다. Earliest Deadline Algorithm(EDA)이나 Least Laxity Algorithm(LLA)과 같은 기존의 온라인 스케쥴링 알고리즘들은 다중처리기 시스템에서 비주기적인 실시간 태스크들을 스케쥴하는데 적합하지 않다. EDA는 문맥교환 오버헤드가 낮지만 스케쥴링 성공률이 떨어지는 |
영문내용
(English Abstract) |
Multiprocessor supprot for real-time operating systems will be indispensable to the development of highly sophisticated and distributed real-time systems in the near future. The existing on-lin scheduling algorhtims EDA(Earliest Deadlin Algorhtim) and LLA(Least Laxity Algorhtim) are not sufficient for scheduling real-time sporadic tasks in multiprocessor systems. EDA has low context switching overhead, but suffers from "multiple processor anomalies." LLA shows a high pass rate in task scheduling (shown as suboptimal), but has the potential for high context switching overhead. We propose a new on-line scheduling algorithm EDZL(Earliest Deadlin Zero Laxity) which is a suboptima algorithm for two processors. EDZL is based on EDA fundamentally but uses LLA as soon as lacity value of any task becomes zero. EDZL has both a high pass rate in scheduling and low context swithcing overhead even in multiprocessor systems. We, also, present an efficient algorhtim EDA2 under overloaded phases. EDA2 improves EDA in overloaded phase handling technique and enhances performance of real time system by removing infeasible tasks from ready queue at scheduling time. |
| 키워드(Keyword) |
|
| 파일첨부 |
PDF 다운로드
|
