DOI QR코드

DOI QR Code

A deferring strategy to improve schedulability for the imprecise convergence on-line tasks

부정확한 융복합 온라인 태스크들의 스케쥴가능성을 향상시키기 위한 지연 전략

  • Song, Gi-Hyeon (Division of Medical Business Administration, Daejeon Health Institute Of Technology)
  • 송기현 (대전보건대학교 의료경영과)
  • Received : 2020.12.04
  • Accepted : 2021.02.20
  • Published : 2021.02.28

Abstract

The imprecise real-time scheduling can be used for minimizing the bad effects of timing faults by leaving less important tasks unfinished if necessary when a transient overload occured. In the imprecise scheduling, every time-critical task can be logically decomposed into two tasks : a mandatory task and an optional task. Recently, some studies in this field showed good schedulability performance and minimum total error by deferring the optional tasks. But the schedulability performance of the studies can be shown only when the execution time of each optional task was less than or equal to the execution time of its corresponding mandatory task. Therefore, in this paper, a new deferring strategy is proposed under the reverse execution time restriction to the previous studies. Nevertheless, the strategy produces comparable or superior schedulability performance to the previous studies and can minimize the total error also.

부정확한 실시간 스케쥴링은 실시간 시스템에 일시적인 과부하가 발생할 때, 보다 덜 중요한 태스크들을 희생시킴으로서 시간적 오류들의 결과로 발생될 수 있는 나쁜 효과들을 최소화시키기 위하여 사용될 수 있다. 부정확한 실시간 스케쥴링에 있어서, 모든 경성 실시간 태스크는 논리적으로 필수적 태스크와 선택적 태스크로 나누어 질 수 있다. 최근들어서, 선택적 태스크들을 지연시킴으로서 총오류를 최소화시키면서도 필수적 태스크들의 스케쥴가능성을 향상시키는 연구들이 진행되어 왔다. 그러나, 이러한 연구들에서의 스케쥴가능성은 각 각의 선택적 태스크의 실행요구시간이 대응하는 필수적 태스크의 실행요구시간보다 작거나 같을 때 에만 적용된다는 제약이 있었다. 그래서, 본 논문에서는 이전의 연구들의 필수적 및 선택적 태스크들에 대한 실행요구시간 제약조건과 정 반대되는 제약조건 하에서도 적용될 수 있는 새로운 지연 전략을 제시하였다. 그럼에도 불구하고, 본 논문에서 제시한 지연 전략은 총오류를 최소화시키면서도 이전 연구들에 비하여 유사하거나 더 우수한 스케쥴가능성 성능을 보여 주었다.

Keywords

References

  1. G. H. Song. (2005). An on-line algorithm to search minimum total error for imprecise real-time tasks with 0/1 constraint. Journal of Korea Multimedia Society, 8(12), 1589-1596.
  2. J. Y. Chung, W. K. Shih, J. W. S. Liu & D. W. Gillies. (1989). Scheduling imprecise computations to minimize total error. Microprocessing and Microprogramming, 27, 767-774. https://doi.org/10.1016/0165-6074(89)90146-4
  3. J. W. S. Liu, W. K. Shih, K. J. Lin, R. Bettati & J. Y. Chung. (1994). Imprecise computations. IEEE Special Issue on Real-Time Systems, 83-94.
  4. W. K. Shih, J. W. S. Liu & J. Y. Chung. (1991). Fast algorithms for scheduling imprecise computaions. SIAM Journal on Computing, 20, 537-552. https://doi.org/10.1137/0220035
  5. H. P. Choi & Y. S. Kim. (2011). An EDF Based Real-Time Scheduling Algorithm for Imprecise Computation. Korea Information Processing Society, 18(4), 143-150.
  6. G. H. Song & K. H. Jeon. (2014). A study on the defering method of the optional tasks. Journal of The Korea Knowledge Information Technology Society(JKKITS), 9(1), 22-29.
  7. G. H. Song. (2015). A study on new defering method for optional tasks to improve schedulability. Journal of The Korea Knowledge Information Technology Society(JKKITS), 10(3), 337-346.
  8. G. H. Song. (2006). An efficient algorithm to minimize total error of the imprecise real time tasks with 0/1 constraint. Journal of Korea Computer Industry Education Society, 7(4), 309-320.
  9. G. H. Song. (2007). Scheduling algorithm to minimize total error for imprecise on-line tasks. Journal of Korea Multimedia Society, 10(12), 1741-1751.
  10. G. H. Song. (2007). An improved online algorithm to minimize total error of the imprecise tasks with 0/1 constraint. Journal of Korean Institute of Information Scientists and Engineers, 34(10), 493-501.
  11. W. K. Shih & J. W. S. Liu. (1996). On-line algorithms for scheduling imprecise computations. SIAM Journal on Computing, 25, 1105-1121. https://doi.org/10.1137/S0097539792233634
  12. J. M. Chen, W. C. Lu, W. K. Shih & M. C. Tang. (2009). Imprecise computations with deferred optional tasks. Journal of Information Science and Engineering, 25, 185-200.
  13. S. K. Baruah & M. E. Hickey. (1998). Competitive on-line scheduling of imprecise computations. IEEE Transactions on Computers, 47, 1027-1032. https://doi.org/10.1109/12.713322
  14. J. H. Kim, K. Song, K. Choi & G. Jung. (1998). Performance evaluation of on-line scheduling algorithms for imprecise computation. Proceedings of the 5th IEEE International Conference on Real-Time Computing Systems and Applications, 217-222.
  15. Riccardo Bettati, Nicholas S. Bowen & J. Y. Chung. (1993). On-line scheduling for checkpointing imprecise computation. Proceeding of the Fifth Euromicro Workshop on Real-Time Systems.