The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

Extended Slack Stealing Algorithm for Improve Response Time of Aperiodic Tasks

비주기 태스트의 응답시간을 개선하기 위해 확장한 슬랙 스틸링 알고리즘

  • 최만억 (수원대학교 대학원 전자계산학과) ;
  • 한대만 (수원대학교 대학원 전자계산학과) ;
  • 구용완 (수원대학교 전자계산학과)
  • Published : 2000.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper intends to improve the problems of the slack stealing algorithm scheduling for periodic tasks with fixed priority and aperiodic tasks which occur dynamically. The Slack stealing algorithm reduces unnecessary waiting time by making the service possible immediately when the slack stealing server gives suitable priority to aperiodic tasks according to the status of aperiodic tasks arrivals at runtime. But no performs the slack stealing, we must calculate execution time of periodic tasks till the point of random. And, execution time of periodic tasks is being repeatedly every hours while the slack algorithm is applied. We show time complexity hen is used as to O(n) if the nubmer of tasks which is applied to the calculation is n. In this appear, due to stored in tables slack times and the execution times of the scheduled periodic tasks, the complexity of aperiodic tasks which is occurring dynamically reduced to O(log n) and improves the responses times. We prove the algorithm proposed in this paper through the simulation.

본 논문은 고정 우선순위를 가지는 주기 태스크와 동적으로 발생하는 비주기 태스크를 스케줄링하는 슬렉 스틸링(slack stealing) 알고리즘의 문제점을 개선하다. 슬랙 스틸링 알고리즘은 비주기 태스크의 발생에 따라 슬랙 스틸링 서버가 적합한 우선순위를 비주기 태스크에 부어하여 즉시 서비스 가능하도록 함으로써 불필요한 대기시간을 최소화하고 있다. 하지만, 슬랙 스틸링을 수행하기 위해서는 임의의 시점가지 주기적 태스크의 수행 시간을 구해야 한다. 그리고 주기적 태스크의 수행 시간은 슬랙 알고리즘을 적용하는 동안 매 시간 마다 다디 구해지고 이싸다. 이때 사 되는 시간 복잡도는 계산에 적용되는 태스크의 수가 n이라면 O(n)으로 나타난다. 본 논문에서는 스케쥴링된 쥐적 태스크의 슬랙타임과 수행시간을 테이블에 저장하여 비주기 태스크가 사용하는 슬랙을 구함으로서 동적으로 발생하는 비주기적 태스크의 복잡도를 O(log n)으로 감소시키고 응답시간을 향상시킨다. 본 논문에서 제안한 알고리즘을 모의 실험을 통하여 증명한다.여 증명한다.

Keywords

References

  1. Alia Atlas and Azer Bestavros, 'Slack stealing job admission control,' Technical Report BUCS-TR98-009, Boston University, Computer Science Department, 1998
  2. Alia Atlas and Azer Bestavros, 'Maintaining Quality of service or multimeia systems using statistical rate monotonic scheduling,' Technical Report BUCS-TR-98-011, Boston University, Computer Science Department, 1998
  3. B. Sprunt, L. Sha, and J. P. Lehoczky, 'Aperiodic Task Scheduling for Hard Real_Time Systems,' Real-Time Systems, Vol.1, pp.27-69, 1989 https://doi.org/10.1007/BF02341920
  4. C. L. Uu and J. W. Layland, 'Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,' Journal of the ACM, Vol.20, No.1, pp.46-61, 1973 https://doi.org/10.1145/321738.321743
  5. J, Lehoczky, L. Sha, and Y. Ding, 'The Rate Monotonic Scheduling Algorithm : Exact Characterization and Average Case Behavior,' In Proceedings of the 10th Real-Time Systems Symposium, pp. 166-171,1989 https://doi.org/10.1109/REAL.1989.63567
  6. LuiSha, John P. Lehoczky, and Ragunathan Rajkurnar. 'Solutions for some practical problems in prioritized preemptive scheduling,' IEEE Real-Time Systems, 1994
  7. M. Spuri and G. C. Buttazzo, 'Efficient Aperiodic Service under Earliest Deadline Scheduling,' Proceedings of Real-Time Systems Symposium, pp.2-11, 1994 https://doi.org/10.1109/REAL.1994.342735
  8. Neil C. Audsley, Alan Burns, Roburt I. Davis, Ken W. Tindell, and Andy J. Wellings, 'Fixed priority preemptive scheduling : An historical perspective, Real-Time System,' 1993 https://doi.org/10.1007/BF01094342
  9. Robert Davis, 'Guaranteeing X in Y : On-line Acceptance Tests for Hard Aperiodic Tasks Scheduled by the Slack Stealing Algorithm,' University of York, Y01 5DD, England, 1994
  10. R. I. Davis, 'Scheduling Slack Time in Fixed Priority Preemptive System,' University of York, England, 1993 https://doi.org/10.1109/REAL.1993.393496
  11. R. I. Davis, 'Approximate Slack Stealing Algorithm for Fixed Priority Pre-emptive System,' University of York, England, 1994
  12. R. I. Davis, 'Dual Priority Scheduling : A Means of Providing Flexibility in Hard Real-Time System,' Dept, Computer Science, University of York, 1996
  13. S. R. Thuel and J. P. Lehoczky, 'On-line Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Priority System,' In Processing of the 14th Real-Time Systems Symposium, 1993 https://doi.org/10.1109/REAL.1993.393504
  14. T. M. Ghazalie and T. P. Baker, 'Aperiodic Servers in a Deadline Scheduling Environment,' Real-Time System, Vol.9, No.1, pp.31-67, 1995 https://doi.org/10.1007/BF01094172