http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
단일 프로세서상에서 수행되는 실시간 타스크의 시행 가치 최대화를 위한 동적 스케줄링
김인수(Kim In Soo),이윤열(Lee Yun Yeol),이춘희(Lee Chun Hee),정기현(Jung Gi Hyun),최경희(Choi Kyung Hee) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.6
In most of the existing real-time schedulers producing the total value as large as possible, the service times for all schedulable tasks are computed at each time a new task arrives. If all scheduled tasks would be executed completely before a new task arrives, the schedule may produce the greatest total value. But this is not always true in real situations. In many cases, (a) new tasks arrive(s) before all the scheduled tasks are executed completely. In this paper, we propose a unique scheduling algorithm for real-time tasks. The proposed algorithm determines the service times only for some tasks with earlier deadlines, while the existing algorithms determine the service times for all tasks. This partial computation decreases the average scheduling complexity dramatically, even though, in the worst case, the complexity of the proposed algorithm becomes O(N^2), which is equal to that of a previous algorithm that has been known as a less complicated one.