발간년도 : [2015]
| 논문정보 |
|
| 논문명(한글) |
[Vol.10, No.3] A Study on New Defering Method for Optional Tasks to Improve Schedulability |
|
| 논문투고자 |
Gi-Hyeon Song |
|
| 논문내용 |
The imprecise computation technique prevents timing faults and achieves graceful degradation by making sure that an approximate result of an acceptable quality is available to the user whenever the exact result of the desired quality cannot be obtained in time. In the imprecise scheduling, NORA algorithm can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But the NORA algorithm has low schedulability problem. Then, DOP algorithm delays the optional parts of the earliest deadline tasks as many as possible but the algorithm is almost similar to SMF(Schedule Mandatory First) algorithm. Next, DMO algorithm showing similar total error and schedulability to DOP algorithm preserving deadline order of tasks is proposed. To improve schedulability of DMO algorithm, this paper proposes a new algorithm which delays the optional parts of the earliest deadline tasks as many as possible. The proposed algorithm showes higher schedulability and similar total error than DMO algorithm. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
