
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Robert I. Davis, Attila Zabos, Alan Burns, "Efficient Exact Schedulability Tests for Fixed Priority RealTime Systems," IEEE Transactions on Computers, vol. 57, no. 9, pp. 12611276, September, 2008.  
BibTex  x  
@article{ 10.1109/TC.2008.66, author = {Robert I. Davis and Attila Zabos and Alan Burns}, title = {Efficient Exact Schedulability Tests for Fixed Priority RealTime Systems}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {9}, issn = {00189340}, year = {2008}, pages = {12611276}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.66}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Efficient Exact Schedulability Tests for Fixed Priority RealTime Systems IS  9 SN  00189340 SP1261 EP1276 EPD  12611276 A1  Robert I. Davis, A1  Attila Zabos, A1  Alan Burns, PY  2008 KW  Multiprocessing/multiprogramming/multitasking KW  Scheduling KW  Realtime systems and embedded systems VL  57 JA  IEEE Transactions on Computers ER   
[1] M.S. Fineberg and O. Serlin, “Multiprogramming for Hybrid Computation,” Proc. AFIPS Fall Joint Computing Conf., pp. 113, 1967.
[2] O. Serlin, “Scheduling of Time Critical Processes,” Proc. AFIPS Spring Computing Conf., pp. 925932, 1972.
[3] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a HardRealTime Environment,” J. ACM, vol. 20, no. 1, pp. 4661, Jan. 1973.
[4] 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.
[5] M. Joseph and P.K. Pandya, “Finding Response Times in a RealTime System,” The Computer J., vol. 29, no. 5, pp. 390395, Oct. 1986.
[6] J.P. Lehoczky, L. Sha, and Y. Ding, “The RateMonotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior,” Proc. 10th IEEE RealTime Systems Symp., pp. 166172, 1989.
[7] 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.
[8] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. 11th IEEE RealTime Systems Symp., pp. 201209, Dec. 1990.
[9] T.P. Baker, “StackBased Scheduling of RealTime Processes,” RealTime Systems J., vol. 3, no. 1, pp. 67100, 1991.
[10] K.W. Tindell, “Using Offset Information to Analyse Static Priority PreEmptively Scheduled Task Sets,” Technical Report YCS92182, Dept. of Computer Science, Univ. of York, 1992.
[11] 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.
[12] K.W. Tindell, A. Burns, and A.J. Wellings, “An Extendible Approach for Analyzing Fixed Priority Hard RealTime Tasks,” RealTime Systems, vol. 6, no. 2, pp. 133151, Mar. 1994.
[13] M. Sjodin and H. Hansson, “Improved Response Time Analysis Calculations,” Proc. 19th IEEE RealTime Systems Symp., pp. 399408, Dec. 1998.
[14] R.J. Bril, W.F.J. Verhaegh, and EJ.D. Pol, “Initial Values for Online Response Time Calculations,” Proc. 15th Euromicro Conf. RealTime Systems, pp. 1322, July 2003.
[15] E. Bini and G.C. Buttazzo, “Measuring the Performance of Schedulability Tests,” RealTime Systems, vol. 30, nos. 12, pp.129154, May 2005.
[16] WC. Lu, JW. Hsieh, WK. Shih, and TW. Kuo, “A Faster Exact Schedulability Analysis for FixedPriority Scheduling,” J. Systems and Software, vol. 79, no. 12, pp. 17441753, Dec. 2006.
[17] WC. Lu, KJ. Lin, HW. Wei1, and WK. Shih, “PeriodDependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems,” Proc. 21st Int'l Parallel and Distributed Processing Symp., pp. 18, Mar. 2007.
[18] E. Bini and S.K. Baruah, “Efficient Computation of Response Time Bounds under FixedPriority Scheduling,” Proc. 15th Int'l Conf. RealTime and Network Systems, pp. 95104, Mar. 2007.
[19] E. Bini and G.C. Buttazzo, “Schedulability Analysis of Periodic Fixed Priority Systems,” IEEE Trans. Computers, vol. 53, no. 11, pp.14621473, Nov. 2004.
[20] A. Zuhily and A. Burns, “Optimality of (DJ)Monotonic Priority Assignment,” Information Processing Letters, no. 103, pp. 247250, Apr. 2007.
[21] R.J. Bril, J.J. Lukkien, and W.F.J. Verhaegh, “WorstCase Response Time Analysis of RealTime Tasks under FixedPriority Scheduling with Deferred Preemption Revisited,” Proc. 19th Euromicro Conf. RealTime Systems, pp. 269279, July 2007.
[22] N.C. Audsley, “Flexible Scheduling of Hard RealTime Systems,” PhD thesis, Dept. of Computer Science, Univ. of York, 1993.
[23] http:/www.frescor.org/, 2007.
[24] “RapiTime White Paper: WorstCase Execution Time Analysis,” www.rapitasystems.com, 2007.
[25] R.I. Davis, A. Burns, R.J. Bril, and J.J. Lukkien, “Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited and Revised,” RealTime Systems, vol. 35, no. 3, pp. 239272, Apr. 2007.
[26] 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.
[27] S. Lauzac, R. Melhem, and D. Mosse, “An Improved RateMonotonic Admission Control and Its Applications,” IEEE Trans. Computers, vol. 52, no. 3, pp. 337350, Mar. 2003.
[28] R.I. Davis, A. Zabos, and A. Burns, “Efficient Exact Schedulability Tests for Fixed Priority PreEmptive Systems,” Technical Report YCS4182007, Dept. of Computer Science, Univ. of York, 2007.
[29] R.I. Davis and A. Burns, “Robust Priority Assignment for Fixed Priority RealTime Systems,” Proc. 28th IEEE RealTime Systems Symp., pp. 112, 2007.