
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Enrico Bini, Thi Huyen Châu Nguyen, Pascal Richard, Sanjoy K. Baruah, "A ResponseTime Bound in FixedPriority Scheduling with Arbitrary Deadlines," IEEE Transactions on Computers, vol. 58, no. 2, pp. 279286, February, 2009.  
BibTex  x  
@article{ 10.1109/TC.2008.167, author = {Enrico Bini and Thi Huyen Châu Nguyen and Pascal Richard and Sanjoy K. Baruah}, title = {A ResponseTime Bound in FixedPriority Scheduling with Arbitrary Deadlines}, journal ={IEEE Transactions on Computers}, volume = {58}, number = {2}, issn = {00189340}, year = {2009}, pages = {279286}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.167}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A ResponseTime Bound in FixedPriority Scheduling with Arbitrary Deadlines IS  2 SN  00189340 SP279 EP286 EPD  279286 A1  Enrico Bini, A1  Thi Huyen Châu Nguyen, A1  Pascal Richard, A1  Sanjoy K. Baruah, PY  2009 KW  Fixedpriority scheduler KW  response time KW  approximation schemes KW  resource augmentation. VL  58 JA  IEEE Transactions on Computers ER   
[1] M. Joseph and P.K. Pandya, “Finding Response Times in a RealTime System,” Computer J., vol. 29, no. 5, pp. 390395, Oct. 1986.
[2] N.C. Audsley, A. Burns, M. Richardson, K.W. Tindell, and A.J. Wellings, “Applying New Scheduling Theory to Static Priority PreEmptive Scheduling,” Software Eng. J., vol. 8, no. 5, pp. 284292, Sept. 1993.
[3] R. Racu, A. Hamann, and R. Ernst, “A Formal Approach to MultiDimensional Sensitivity Analysis of Embedded RealTime Systems,” Proc. 18th Euromicro Conf. RealTime Systems (ECRTS '06), pp. 312, July 2006.
[4] K.W. Tindell, A. Burns, and A. Wellings, “An Extendible Approach for Analysing Fixed Priority Hard RealTime Tasks,” RealTime Systems, vol. 6, no. 2, pp. 133152, Mar. 1994.
[5] J.C. Palencia and M. González Harbour, “Schedulability Analysis for Tasks with Static and Dynamic Offsets,” Proc. 19th IEEE RealTime Systems Symp. (RTSS '98), pp. 2637, Dec. 1998.
[6] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadline,” Proc. 11th IEEE RealTime Systems Symp. (RTSS '90), pp. 201209, Dec. 1990.
[7] R.L. Davis, A. Burns, R.J. Bril, and J.J. Lukkien, “Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited, and Revised,” RealTime Systems, vol. 35, pp. 239272, 2007.
[8] J.P. Lehoczky, L. Sha, and Y. Ding, “The RateMonotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior,” Proc. 10th IEEE RealTime Systems Symp. (RTSS '89), pp. 166171, Dec. 1989.
[9] Y. Manabe and S. Aoyagi, “A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling,” RealTime Systems, vol. 14, no. 2, pp. 171181, Mar. 1998.
[10] E. Bini and G.C. Buttazzo, “Schedulability Analysis of Periodic Fixed Priority Systems,” IEEE Trans. Computers, vol. 53, no. 11, pp. 14621473, Nov. 2004.
[11] M. Sjödin and H. Hansson, “Improved ResponseTime Analysis Calculations,” Proc. 19th IEEE RealTime Systems Symp. (RTSS '98), pp. 399408, Dec. 1998.
[12] J. MäkiTurja and M. Nolin, “Efficient Implementation of Tight ResponseTimes for Tasks with Offsets,” RealTime Systems, Feb. 2008.
[13] K. Albers and F. Slomka, “An Event Stream Driven Approximation for the Analysis of RealTime Systems,” Proc. 16th Euromicro Conf. RealTime Systems (ECRTS '04), pp. 187195, June 2004.
[14] N. Fisher and S. Baruah, “A Fully PolynomialTime Approximation Scheme for Feasibility Analysis in StaticPriority Systems,” Proc. 17th Euromicro Conf. RealTime Systems (ECRTS '05), pp. 117126, July 2005.
[15] P. Richard, J. Goossens, and N. Fisher, “Approximate Feasibility Analysis and ResponseTime Bounds of StaticPriority Tasks with Release Jitters,” Proc. 15th Int'l Conf. RealTime and Network Systems (RTNS '07), Mar. 2007.
[16] E. Bini and S.K. Baruah, “Efficient Computation of Response Time Bounds under FixedPriority Scheduling,” Proc. 15th Int'l Conf. RealTime and Network Systems (RTNS '07), Mar. 2007.
[17] W.C. Lu, J.W. Hsieh, and W.K. Shih, “A Precise Schedulability Test Algorithm for Scheduling Periodic Tasks in RealTime Systems,” Proc. 21st Ann. ACM Symp. Applied Computing (SAC '06), pp. 14511455, Apr. 2006.
[18] A.K.L. Mok, “Fundamental Design Problems of Distributed Systems for the HardRealTime Environment,” PhD dissertation, Dept. Electrical Eng. and Computer Science, Massachusetts Inst. Tech nology, May 1983.
[19] S.K. Baruah, A.K. Mok, and L.E. Rosier, “Preemptively Scheduling HardRealTime Sporadic Tasks on One Processor,” Proc. 11th IEEE RealTime Systems Symp. (RTSS '90), pp. 182190, Dec. 1990.
[20] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard RealTime Environment,” J. ACM, vol. 20, no. 1, pp. 4661, Jan. 1973.
[21] J.Y.T. Leung and J. Whitehead, “On the Complexity of FixedPriority Scheduling of Periodic RealTime Tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237250, Dec. 1982.
[22] S. Lauzac, R. Melhem, and D. Mossé, “An Improved RateMonotonic Admission Control and Its Applications,” IEEE Trans. Computers, vol. 52, no. 3, pp. 337350, Mar. 2003.
[23] E. Bini, G.C. Buttazzo, and G.M. Buttazzo, “Rate Monotonic Scheduling: The Hyperbolic Bound,” IEEE Trans. Computers, vol. 52, no. 7, pp. 933942, July 2003.
[24] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to RealTime Synchronization,” IEEE Trans. Computers, vol. 39, no. 9, pp. 11751185, Sept. 1990.
[25] T.P. Baker, “StackBased Scheduling of RealTime Processes,” RealTime Systems, vol. 3, no. 1, pp. 67100, 1991.
[26] E. Bini and G.C. Buttazzo, “Measuring the Performance of Schedulability Tests,” RealTime Systems, vol. 30, nos. 1/2, pp. 129154, May 2005.