본문 바로가기
  • Home

A Study on The Deffering Method of The Optional Tasks in The Imprecise Real-Time Scheduling

  • Journal of Knowledge Information Technology and Systems
  • Abbr : JKITS
  • 2014, 9(1), pp.95-104
  • Publisher : Korea Knowledge Information Technology Society
  • Research Area : Interdisciplinary Studies > Interdisciplinary Research
  • Published : February 28, 2014

Song Gi-Hyeon 1 전근형 1

1대전보건대학교

Accredited

ABSTRACT

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. The NORA algorithm produces minimum total error but has low schedulability problem by prior executing the optional parts of the earliest deadline tasks than the mandatory parts of the latest deadline tasks. To improve this problem, the DOP algorithm which delays the optional parts of the earliest deadline tasks but this algorithm seems to be almost similier with the previous famous SMF(Schedule Mandatory First) algorithm. Therefore, this paper proposes a new method which delays the optional parts of the earliest deadline tasks and demonstrates several superior advantages by comparing and analyzing in the aspects of the schedulability and total error with previous the NORA, DOP(SMF) algorithms.

Citation status

* References for papers published after 2023 are currently being built.