메뉴 건너뛰기




Volumn , Issue , 2001, Pages 37-44

A modular and retargetable framework for tree-based WCET analysis

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURAL FEATURES; HARD REAL-TIME SYSTEMS; INSTRUCTION CACHES; INTEGRATED APPROACH; INTEGRATION ISSUES; STATIC SIMULATIONS; WORST-CASE EXECUTION TIME; WORST-CASE EXECUTION TIME ANALYSIS;

EID: 84884687003     PISSN: 10683070     EISSN: None     Source Type: Journal    
DOI: 10.1109/EMRTS.2001.933995     Document Type: Article
Times cited : (71)

References (20)
  • 2
    • 0033733125 scopus 로고    scopus 로고
    • Worst case execution time analysis for a processor with branch prediction
    • May
    • A. Colin and I. Puaut. Worst case execution time analysis for a processor with branch prediction. Real-Time Systems, 18(2-3):249-274, May 2000
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 249-274
    • Colin, A.1    Puaut, I.2
  • 7
    • 84882696607 scopus 로고    scopus 로고
    • Deriving Annotations for Tight Calculation of Execution Time
    • Euro-Par'97 Parallel Processing
    • A. Ermedahl and J. Gustafsson. Deriving annotations for tight calculation of executing time. In Proc. Euro-Par'97 Parallel Processing, volume 986 of Lecture Notes in Computer Sciences, pages 1298-1307. Springer-Verlag, Aug. 1997. (Pubitemid 127120911)
    • (1997) LECTURE NOTES IN COMPUTER SCIENCE , vol.1300 , pp. 1298-1307
    • Ermedahl, A.1    Gustafsson, J.2
  • 10
    • 84976752841 scopus 로고
    • Performance analysis of embedded software using implicit path enumeration
    • R. Gerber and T. Marlowe, editors, ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems, New York, NY, USA, Nov. ACM Press
    • Y.-T. S. Li and S. Malik. Performance analysis of embedded software using implicit path enumeration. In R. Gerber and T. Marlowe, editors, ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems, volume 30 of ACM SIGPLAN Notices, pages 88-98, New York, NY, USA, Nov. 1995. ACM Press
    • (1995) ACM SIGPLAN Notices , vol.30 , pp. 88-98
    • Li, Y.-T.S.1    Malik, S.2
  • 11
    • 0030414718 scopus 로고    scopus 로고
    • Cache modeling for real-time software: Beyond direct mapped instruction cache
    • IEEE, IEEE Computer Society Press, Dec
    • Y.-T. S. Li, S. Malik, and A. Wolfe. Cache modeling for real-time software: Beyond direct mapped instruction cache. In Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS96), pages 254-263. IEEE, IEEE Computer Society Press, Dec. 1996
    • (1996) Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS96) , pp. 254-263
    • Li, Y.-T.S.1    Malik, S.2    Wolfe, A.3
  • 13
    • 0033732401 scopus 로고    scopus 로고
    • Timing analysis for instruction caches
    • May
    • F. Mueller. Timing analysis for instruction caches. Real-Time Systems, 18(2):217-247, May 2000
    • (2000) Real-Time Systems , vol.18 , Issue.2 , pp. 217-247
    • Mueller, F.1
  • 15
    • 0027556297 scopus 로고
    • Predicting program execution times by analyzing static and dynamic program paths
    • C. Y. Park. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, 5(1):31-62, 1993
    • (1993) Real-Time Systems , vol.5 , Issue.1 , pp. 31-62
    • Park, C.Y.1
  • 16
    • 0026156694 scopus 로고
    • Experiments with a program timing tool based on source-level timing schema
    • May
    • C. Y. Park and A. C. Shaw. Experiments with a program timing tool based on source-level timing schema. In IEEE Computer, pages 48-57, May 1991
    • (1991) IEEE Computer , pp. 48-57
    • Park, C.Y.1    Shaw, A.C.2
  • 17
    • 0013225410 scopus 로고    scopus 로고
    • A review of worst-case execution-time analysis
    • May Guest Editorial
    • P. Puschner and A. Burns. A review of worst-case execution-time analysis. Real-Time Systems, 18(2-3):115-128, May 2000. Guest Editorial
    • (2000) Real-Time Systems , vol.18 , Issue.2-3 , pp. 115-128
    • Puschner, P.1    Burns, A.2
  • 18
    • 0000039023 scopus 로고
    • Calculating the maximum execution time of real-time programs
    • Sept
    • P. Puschner and C. Koza. Calculating the maximum execution time of real-time programs. Real-Time Systems, 1(2):159-176, Sept. 1989
    • (1989) Real-Time Systems , vol.1 , Issue.2 , pp. 159-176
    • Puschner, P.1    Koza, C.2
  • 19
    • 0031186994 scopus 로고    scopus 로고
    • Computing maximum task execution times - A graph based approach
    • Kluwer Academic Publishers
    • P. Puschner and A. V. Schedl. Computing maximum task execution times - a graph based approach. In Proc. of IEEE Real-Time Systems Symposium, volume 13, pages 67-91. Kluwer Academic Publishers, 1997
    • (1997) Proc. of IEEE Real-Time Systems Symposium , vol.13 , pp. 67-91
    • Puschner, P.1    Schedl, A.V.2
  • 20
    • 0000626731 scopus 로고    scopus 로고
    • Complete worst-case execution time analysis of straight-line hard real-time programs
    • F. Stappert and P. Altenbernd. Complete worst-case execution time analysis of straight-line hard real-time programs. Journal of Systems Architecture, 46(4):339-355, 2000
    • (2000) Journal of Systems Architecture , vol.46 , Issue.4 , pp. 339-355
    • Stappert, F.1    Altenbernd, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.