This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comment on 'On-Line Scheduling Policies for a Class of IRIS Real-Time Tasks'
May 2001 (vol. 50 no. 5)
pp. 526-528

Abstract—Scheduling policies for real-time tasks which receive rewards that depend on the amount of service received were presented by Dey et al. The policies utilized heuristic approaches to maximize the total accrued reward. In this comment, we propose an extension of their work that may reduce the average computational complexity.

[1] J.K. Dey, J. Kurose, and D. Towsley, On-Line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks IEEE Trans. Computers, vol. 45, no. 7, pp. 802-813, July 1996.
[2] J. Dey, J. Kurose, D. Towsley, C. Krishna, and M. Girkar, "Efficient On-Line Processor Scheduling for a Class of IRIS Real-Time Tasks," Proc. 13th ACM SIGMETRICS Conf., pp. 217-228,Santa Clara, Calif., May 1993.

Index Terms:
Scheduling, real-time.
Citation:
Kyunghee Choi, Gihyun Jung, "Comment on 'On-Line Scheduling Policies for a Class of IRIS Real-Time Tasks'," IEEE Transactions on Computers, vol. 50, no. 5, pp. 526-528, May 2001, doi:10.1109/12.926165
Usage of this product signifies your acceptance of the Terms of Use.