Browse > Article

Enhancement of Response Time of Real-Time Tasks with Variable Execution Times by Using Shared Bandwidth  

Kim, Yong-Seok (Kangwon National University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea CI / v.46, no.3, 2009 , pp. 77-85 More about this Journal
Abstract
Execution times of tasks can be variable depend on input data. If we choose a high performance processor to satisfy the worst case execution times, the hard cost becomes high and the energy consumption also becomes large. To apply a lower performance processor, we have to utilize processor capacity maximally while overrunning tasks can not affect deadlines of other tasks. To be used for such systems, this paper presents SBP (Shared Bandwidth Partitioning) that a processor bandwidth is reserved and shared among all tasks. If a task needs more processor capacity, it can use a portion of the shared bandwidth. A simulation result shows that SBP provides better performance than previous algorithms. SBP reduces deadline miss ratio which is related to scheduling quality. And the number of context switches, which is related to system overhead, is also reduced.
Keywords
스케줄링;연성 실시간 태스크;공유 대역폭;슬랙 재활용;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C. L. Liu and J. W. Layland, 'Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,' Journal of ACM, vol. 20, no. 1, pp. 40-61, 1973   DOI
2 G. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, 2nd ed., Springer, 2005
3 G. Lipari and S. Baruah, 'Greedy Reclamation of Unused Bandwidth in Constant Bandwidth Servers,' Proc. of IEEE 12th Euromicro Conference on Real-Time Systems, pp.234-241, June 2000   DOI
4 김용석, '연성 실시간 태스크들의 스케줄링을 위한 적극적인 슬랙 재활용', 대한전자공학회 논문지, 제43권 CI편 제2호, pp. 12-20, 2006년 3월   과학기술학회마을
5 M. Spurri and G. Buttazzo, 'Scheduling Aperiodic Tasks in Dynamic Priority Systems,' Journal of Real-Time Systems, 10(2), 1996   DOI
6 J.W.S Liu, K. Lin, W. Shih, A. Yu, C. Chung, J. Yao, and M. Zhao, 'Algorithms for Scheduling Imprecise Computations', IEEE Computer, 24(5) pp. 587-68, May 1991
7 Y. Chu and A. Burns, 'Supporting Deliverable Real-Time AI Systems: A Fixed Priority Scheduling Approach', 19th Euromicro Conf. on Real-Time Systems, pp. 259-268, July 2007
8 M. Caccamo, G. Buttazo, and D. Thomas, 'Efficient Reclaiming in Reservation-Based Real-Time Systems with Variable Execution Times,', IEEE Trans. on Computers, vol. 54, no. 2, pp. 198-213, Feb. 2005   DOI   ScienceOn
9 L. Abeni and G. Buttazo, 'Resource Reservations in Dynamic Real-Time Systems,' Real-Time Systems, vol. 27, no. 2, pp. 123-167, Kluwer Academic Publishers, 2004   DOI   ScienceOn
10 C. W. Mercer, S. Savage, and H. Tokuda, 'Processor Capacity Reserves: Operating System Support for Multimedia Applications,' Proc. 1st Int. Conference on Multimedia Computing and Systems, IEEE, 1994