This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Reclaiming in Reservation-Based Real-Time Systems with Variable Execution Times
February 2005 (vol. 54 no. 2)
pp. 198-213
Click here
In this paper, we present a general CPU scheduling methodology for managing overruns in a real-time environment, where tasks may have different criticality, flexible timing constraints, shared resources, and variable execution times. The proposed method enhances the Constant Bandwidth Server (CBS) by providing two important extensions. First, it includes an efficient bandwidth sharing mechanism that reclaims the unused bandwidth to enhance task responsiveness. It is proven that the reclaiming mechanism does not violate the isolation property of the CBS and can be safely adopted to achieve temporal protection even when resource reservations are not precisely assigned. Second, the proposed method allows the CBS to work in the presence of shared resources. The enhancements achieved by the proposed approach turned out to be very effective with respect to classical CPU reservation schemes. The algorithm complexity is {\cal O}(ln N), where N is the number of real-time tasks in the system, and its performance has been experimentally evaluated by extensive simulations.

[1] L. Abeni and G. Buttazzo, “Integrating Multimedia Applications in Hard Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1998.
[2] L. Abeni and G. Buttazzo, “Resource Reservations in Dynamic Real-Time Systems,” Real-Time Systems, vol. 27, no. 2, pp. 123-165, 2004.
[3] T.P. Baker, “Stack-Based Scheduling of Real-Time Processes,” J. Real-Time Systems, vol. 3, no. 1, pp. 67-100, 1991.
[4] G. Bernat and A. Burns, “Multiple Servers and Capacity Sharing for Implementing Flexible Scheduling,” Real-Time Systems, vol. 22, nos. 1-2, pp. 49-75, Jan.-Mar. 2002.
[5] M. Caccamo, G. Buttazzo, and L. Sha, “Elastic Feedback Control,” Proc. IEEE 12th Euromicro Conf. Real-Time Systems, June 2000.
[6] M. Caccamo, G. Buttazzo, and L. Sha, “Capacity Sharing for Overrun Control,” Proc. IEEE Real-Time Systems Symp., Dec. 2000.
[7] M. Caccamo and L. Sha, “Aperiodic Servers with Resource Constraints,” Proc. IEEE Real-Time Systems Symp., Dec. 2001.
[8] Z. Deng and J.W.S. Liu, “Scheduling Real-Time Applications in an Open Environment,” Proc. IEEE Real-Time Systems Symp., Dec. 1997.
[9] M.K. Gardner and J.W.S. Liu, “Performance of Algorithms for Scheduling Real-Time Systems with Overrun and Overload,” IEEE Proc. 11th Euromicro Conf. Real-Time Systems, June 1999.
[10] D.E. Knuth, The Art of Computer Programming. Addison-Wesley, 1998.
[11] G. Lipari and G. Buttazzo, “Scheduling Real-Time Multi-Task Applications in an Open System,” Proc. IEEE 11th Euromicro Conf. Real-Time Systems, pp. 234-241, June 1999.
[12] G. Lipari and S. Baruah, “Greedy Reclaimation of Unused Bandwidth in Constant-Bandwidth Servers,” IEEE Proc. 12th Euromicro Conf. Real-Time Systems, June 2000.
[13] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[14] C.W. Mercer, S. Savage, and H. Tokuda, “Processor Capacity Reserves for Multimedia Operating Systems,” Proc. IEEE Intl Conf. Multimedia Computing and Systems, May 1994.
[15] A.K. Mok and D. Chen, “A Multiframe Model for Real-Time Tasks,” Proc. IEEE Real-Time System Symp., Dec. 1996.
[16] Real-Time System SIMulator (RTSIM), http:/rtsim.sssup.it, 2004.
[17] D. Seto, J.P. Lehoczky, L. Sha, and K.G. Shin, “On Task Schedulability in Real-Time Control Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1996.
[18] K.G. Shin, C.M. Krishna, and Y.-H. Lee, “A Unified Method for Evaluating Real-Time Computer Controllers and Its Application,” IEEE Trans. Automatic Control, pp. 357-365, Apr. 1985.
[19] B. Sprunt, L. Sha, and J.P. Lehoczky, “Aperiodic Scheduling for Hard Real-Time System,” J. Real-Time Systems, vol. 1, pp. 27-60, 1989.
[20] J. Sun and J.W.S. Liu, “Bounding Completion Times of Jobs with Arbitrary Release Times and Variable Execution Times,” Proc. IEEE Real-Time System Symp., Dec. 1996.
[21] T.-S. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L.-C. Wu, and J.W.-S. Liu, “Probabilistic Performance Guarantee for Real-Time Tasks with Varying Computation Times,” Proc. IEEE Real-Time Technology and Applications Symp., Jan. 1995.

Index Terms:
Overrun management, overload control, resource reclaiming, variable execution times.
Citation:
Marco Caccamo, Giorgio C. Buttazzo, Deepu C. Thomas, "Efficient Reclaiming in Reservation-Based Real-Time Systems with Variable Execution Times," IEEE Transactions on Computers, vol. 54, no. 2, pp. 198-213, Feb. 2005, doi:10.1109/TC.2005.25
Usage of this product signifies your acceptance of the Terms of Use.