
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblom, "Clustered WorstCase ExecutionTime Calculation," IEEE Transactions on Computers, vol. 54, no. 9, pp. 11041122, September, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.139, author = {Andreas Ermedahl and Friedhelm Stappert and Jakob Engblom}, title = {Clustered WorstCase ExecutionTime Calculation}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {9}, issn = {00189340}, year = {2005}, pages = {11041122}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.139}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Clustered WorstCase ExecutionTime Calculation IS  9 SN  00189340 SP1104 EP1122 EPD  11041122 A1  Andreas Ermedahl, A1  Friedhelm Stappert, A1  Jakob Engblom, PY  2005 KW  Index Terms WCET analysis KW  WCET calculation KW  hard realtime KW  embedded systems. VL  54 JA  IEEE Transactions on Computers ER   
[1] “ASTEC Homepage,” 2005, http:/www.astec.uu.se.
[2] “Vinnova Homepage,” 2005, http:/www.vinnova.se.
[3] N. Audsley, A. Burns, R. Davis, K. Tindell, and A. Wellings, “Fixed Priority PreEmptive Scheduling: An Historical Perspective,” RealTime Systems, vol. 8, nos. 2/3, pp. 129154, 1995.
[4] L. Casparsson, A. Rajnak, K. Tindell, and P. Malmberg, “VolcanoA Revolution in OnBoard Communications,” Volvo Technology Report, vol. 1, pp. 919, 1998.
[5] J. Ganssle, “Really RealTime Systems,” Proc. Embedded Systems Conf. (ESC SF) 2001, Apr. 2001.
[6] R. Kirner and P. Puschner, “Transformation of Path Information for WCET Analysis during Compilation,” Proc. 13th Euromicro Conf. RealTime Systems, (ECRTS '01), June 2001.
[7] J. Engblom and A. Ermedahl, “Modeling Complex Flows for WorstCase Execution Time Analysis,” Proc. 21st IEEE RealTime Systems Symp. (RTSS '00), Nov. 2000.
[8] C. Ferdinand, F. Martin, and R. Wilhelm, “Applying Compiler Techniques to Cache Behavior Prediction,” Proc. ACM SIGPLAN Workshop Languages, Compilers, and Tools for RealTime Systems (LCTRTS '97), 1997.
[9] Y.T.S. Li and S. Malik, “Performance Analysis of Embedded Software Using Implicit Path Enumeration,” Proc. 32nd Design Automation Conf., pp. 456461, 1995.
[10] J. Gustafsson, B. Lisper, C. Sandberg, and N. Bermudo, “A Tool for Automatic Flow Analysis of CPrograms for WCET Calculation,” Proc. Eighth IEEE Int'l Workshop ObjectOriented RealTime Dependable Systems (WORDS '03), Jan. 2003.
[11] C. Healy, R. Arnold, F. Müller, D. Whalley, and M. Harmon, “Bounding Pipeline and Instruction Cache Performance,” IEEE Trans. Computers, vol. 48, no. 1, Jan. 1999.
[12] N. Holsti, T. Långbacka, and S. Saarinen, “WorstCase ExecutionTime Analysis for Digital Signal Processors,” Proc. EUSIPCO 2000 Conf. (X European Signal Processing Conf.), Sept. 2000.
[13] T. Lundqvist and P. Stenström, “An Integrated Path and Timing Analysis Method based on CycleLevel Symbolic Execution,” J. RealTime Systems, May 2000.
[14] F. Stappert and P. Altenbernd, “Complete WorstCase Execution Time Analysis of StraightLine Hard RealTime Programs,” J. Systems Architecture, vol. 46, no. 4, pp. 339355, 2000.
[15] R. Heckmann, M. Langenbach, S. Thesing, and R. Wilhelm, “The Influence of Processor Architecture on the Design and the Results of WCET Tools,” IEEE Proc. RealTime Systems Conf., 2003.
[16] S.S. Lim, Y.H. Bae, C.T. Jang, B.D. Rhee, S.L. Min, C.Y. Park, H. Shin, K. Park, and C.S. Ki, “An Accurate WorstCase Timing Analysis for RISC Processors,” IEEE Trans. Software Eng., vol. 21, no. 7, pp. 593604, July 1995.
[17] S.K. Kim, S.L. Min, and R. Ha, “Efficient Worst Case Timing Analysis of Data Caching,” Proc. Second IEEE RealTime Technology and Applications Symp. (RTAS '96), pp. 230240, 1996.
[18] R. White, F. Müller, C. Healy, D. Whalley, and M. Harmon, “Timing Analysis for Data Caches and SetAssociative Caches,” Proc. Third IEEE RealTime Technology and Applications Symp. (RTAS '97), pp. 192202, June 1997.
[19] A. Colin and I. Puaut, “Worst Case Execution Time Analysis for a Processor with Branch Prediction,” J. RealTime Systems, vol. 18, nos. 2/3, pp. 249274, May 2000.
[20] T. Mitra and A. Roychoudhury, “Effects of Branch Prediction on Worst Case Execution Time of Programs,” Technical Report 1101, Nat'l Univ. of Singapore (NUS), Nov. 2001.
[21] J. Engblom, “Processor Pipelines and Static WorstCase Execution Time Analysis,” PhD dissertation, Dept. of Information Technology, Uppsala Univ., Uppsala, Sweden, Apr. 2002.
[22] J. Engblom and A. Ermedahl, “Pipeline Timing Analysis Using a TraceDriven Simulator,” Proc. Sixth Int'l Conf. RealTime Computing Systems and Applications (RTCSA '99), Dec. 1999.
[23] C. Ferdinand, R. Heckmann, M. Langenbach, F. Martin, M. Schmidt, H. Theiling, S. Thesing, and R. Wilhelm, “Reliable and Precise WCET Determination for a RealLife Processor,” Proc. First Int'l Workshop Embedded Systems (EMSOFT2000), Oct. 2001.
[24] S.S. Lim, J.H. Han, J. Kim, and S.L. Min, “A Worst Case Timing Analysis Technique for MultipleIssue Machines,” Proc. 19th IEEE RealTime Systems Symp. (RTSS '98), Dec. 1998.
[25] J. Schneider and C. Ferdinand, “Pipeline Behaviour Prediction for Superscalar Processors by Abstract Interpretation,” Proc. SIGPLAN Workshop Languages, Compilers and Tools for Embedded Systems (LCTES '99), May 1999.
[26] S. Petters and G. Färber, “Making WorstCase Execution Time Analysis for Hard RealTime Tasks on State of the Art Processors Feasible,” Proc. Sixth Int'l Conf. RealTime Computing Systems and Applications (RTCSA '99), Dec. 1999.
[27] A. Colin and G. Bernat, “ScopeTree: A Program Representation for Symbolic WorstCase Execution Time Analysis,” Proc. 14th Euromicro Conf. RealTime Systems (ECRTS '02), pp. 5059, 2002.
[28] F. Stappert, A. Ermedahl, and J. Engblom, “Efficient Longest Executable Path Search for Programs with Complex Flows and Pipeline Effects,” Proc. Fourth Int'l Conf. Compilers, Architecture, and Synthesis for Embedded Systems (CASES '01), Nov. 2001.
[29] P. Puschner and A. Schedl, “Computing Maximum Task Execution Times with Linear Programming Techniques,” technical report, Technische Universität Wien, Institut für Technische Informatik, Apr. 1995.
[30] A. Ermedahl, “A Modular Tool Architecture for WorstCase Execution Time Analysis,” PhD dissertation, Dept. of Information Technology, Uppsala Univ. Uppsala, Sweden, June 2003.
[31] F. Stappert, “From LowLevel to ModelBased and Constructive WorstCase Execution Time Analysis,” PhD dissertation, Faculty of Computer Science, Electrical Eng., and Math., Univ. of Paderborn, 2004, CLAB Publication, vol. 17, Shaker Verlag.
[32] P. Atanassov, R. Kirner, and P. Puschner, “Using Real Hardware to Create an Accurate Timing Model for ExecutionTime Analysis,” Proc. IEEE RealTime Embedded Systems Workshop, Dec. 2001.
[33] NEC Corp, V850E/MS1 32/16bit Single Chip Microcontroller: Architecture, third ed., Jan. 1999, document no. U12197EJ3V0UM00.
[34] ARM 9TDMI Technical Reference Manual, third ed., ARM Ltd., Mar. 2000, document no. DDI 0180A.
[35] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2002.
[36] C. Healy, M. Sjödin, V. Rustagi, and D. Whalley, “Bounding Loop Iterations for Timing Analysis,” Proc. Fourth IEEE RealTime Technology and Applications Symp. (RTAS '98), June 1998.
[37] M. Berkelaar, lp_solve: (Mixed Integer) Linear Programming Problem Solver, 2004, ftp://ftp.es.ele.tue.nl/publp_solve.
[38] “SICStus Prolog User's Manual,” Swedish Inst. of Computer Science, 1995.
[39] “ILOG CPLEX Homepage,” 2004, http://www.ilog.com/productscplex/.